Storing data and metadata in a distributed storage network

ABSTRACT

A method begins with receiving a data search criteria. The method continues by accessing a master database that includes a plurality of entries, wherein an entry includes a data name field, a metadata field, a data DSN address, and a metadata DSN address. The method continues by indexing the database based on a comparison of the data search criteria with metadata contained in the metadata field of the entries. The method continues by, when one or more entries of the database have the metadata that substantially matches the data search criteria, utilizing the data DSN address of the one or more entries to retrieve one or more sets of encode data slices. The method continues by decoding the one or more sets of encoded data slices to retrieve one or more data segments corresponding to the data search criteria.

CROSS REFERENCE TO RELATED PATENTS

The present U.S. Utility Patent Application claims priority pursuant to35 U.S.C. §120 as a continuation of U.S. Utility application Ser. No.13/527,778, entitled “STORING DATA AND METADATA IN A DISTRIBUTED STORAGENETWORK”, filed Jun. 20, 2012, issuing as U.S. Pat. No. 8,694,545 onApr. 8, 2014, which claims priority pursuant to 35 U.S.C. §119(e) toU.S. Provisional Application No. 61/505,013, entitled “COMPLETINGRETRIEVAL OF CONTENT STORED IN A DISPERSED STORAGE NETWORK”, filed Jul.6, 2011, all of which are hereby incorporated herein by reference intheir entirety and made part of the present U.S. Utility PatentApplication for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

NOT APPLICABLE

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

NOT APPLICABLE

BACKGROUND OF THE INVENTION

1. Technical Field of the Invention

This invention relates generally to computing systems and moreparticularly to data storage solutions within such computing systems.

2. Description of Related Art

Computers are known to communicate, process, and store data. Suchcomputers range from wireless smart phones to data centers that supportmillions of web searches, stock trades, or on-line purchases every day.In general, a computing system generates data and/or manipulates datafrom one form into another. For instance, an image sensor of thecomputing system generates raw picture data and, using an imagecompression program (e.g., JPEG, MPEG, etc.), the computing systemmanipulates the raw picture data into a standardized compressed image.

With continued advances in processing speed and communication speed,computers are capable of processing real time multimedia data forapplications ranging from simple voice communications to streaming highdefinition video. As such, general-purpose information appliances arereplacing purpose-built communications devices (e.g., a telephone). Forexample, smart phones can support telephony communications but they arealso capable of text messaging and accessing the internet to performfunctions including email, web browsing, remote applications access, andmedia communications (e.g., telephony voice, image transfer, musicfiles, video files, real time video streaming. etc.).

Each type of computer is constructed and operates in accordance with oneor more communication, processing, and storage standards. As a result ofstandardization and with advances in technology, more and moreinformation content is being converted into digital formats. Forexample, more digital cameras are now being sold than film cameras, thusproducing more digital pictures. As another example, web-basedprogramming is becoming an alternative to over the air televisionbroadcasts and/or cable broadcasts. As further examples, papers, books,video entertainment, home video, etc., are now being stored digitally,which increases the demand on the storage function of computers.

A typical computer storage system includes one or more memory devicesaligned with the needs of the various operational aspects of thecomputer's processing and communication functions. Generally, theimmediacy of access dictates what type of memory device is used. Forexample, random access memory (RAM) memory can be accessed in any randomorder with a constant response time, thus it is typically used for cachememory and main memory. By contrast, memory device technologies thatrequire physical movement such as magnetic disks, tapes, and opticaldiscs, have a variable response time as the physical movement can takelonger than the data transfer, thus they are typically used forsecondary memory (e.g., hard drive, backup memory, etc.).

A computer's storage system will be compliant with one or more computerstorage standards that include, but are not limited to, network filesystem (NFS), flash file system (FFS), disk file system (DFS), smallcomputer system interface (SCSI), internet small computer systeminterface (iSCSI), file transfer protocol (FTP), and web-baseddistributed authoring and versioning (WebDAV). These standards specifythe data storage format (e.g., files, data objects, data blocks,directories, etc.) and interfacing between the computer's processingfunction and its storage system, which is a primary function of thecomputer's memory controller.

Despite the standardization of the computer and its storage system,memory devices fail; especially commercial grade memory devices thatutilize technologies incorporating physical movement (e.g., a discdrive). For example, it is fairly common for a disc drive to routinelysuffer from bit level corruption and to completely fail after threeyears of use. One solution is to utilize a higher-grade disc drive,which adds significant cost to a computer.

Another solution is to utilize multiple levels of redundant disc drivesto replicate the data into two or more copies. One such redundant driveapproach is called redundant array of independent discs (RAID). In aRAID device, a RAID controller adds parity data to the original databefore storing it across the array. The parity data is calculated fromthe original data such that the failure of a disc will not result in theloss of the original data. For example, RAID 5 uses three discs toprotect data from the failure of a single disc. The parity data, andassociated redundancy overhead data, reduces the storage capacity ofthree independent discs by one third (e.g., n−1=capacity). RAID 6 canrecover from a loss of two discs and requires a minimum of four discswith a storage capacity of n−2.

While RAID addresses the memory device failure issue, it is not withoutits own failure issues that affect its effectiveness, efficiency andsecurity. For instance, as more discs are added to the array, theprobability of a disc failure increases, which increases the demand formaintenance. For example, when a disc fails, it needs to be manuallyreplaced before another disc fails and the data stored in the RAIDdevice is lost. To reduce the risk of data loss, data on a RAID deviceis typically copied on to one or more other RAID devices. While thisaddresses the loss of data issue, it raises a security issue sincemultiple copies of data are available, which increases the chances ofunauthorized access. Further, as the amount of data being stored grows,the overhead of RAID devices becomes a non-trivial efficiency issue.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a computingsystem in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an embodiment of a distributedstorage processing unit in accordance with the present invention;

FIG. 4 is a schematic block diagram of an embodiment of a grid module inaccordance with the present invention;

FIG. 5 is a diagram of an example embodiment of error coded data slicecreation in accordance with the present invention;

FIG. 6 is a schematic block diagram of another embodiment of a computingsystem in accordance with the present invention;

FIG. 7A is a flowchart illustrating an example of verifying storedcontent in accordance with the present invention;

FIG. 7B is a flowchart illustrating another example of verifying storedcontent in accordance with the present invention;

FIG. 8A is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 8B is a flowchart illustrating an example of completing a contentdownload in accordance with the present invention;

FIG. 9 is a flowchart illustrating another example of completing acontent download in accordance with the present invention;

FIG. 10 is a flowchart illustrating another example of completing acontent download in accordance with the present invention;

FIG. 11A is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 11B is a flowchart illustrating an example of distributing contentin accordance with the present invention;

FIG. 12A is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 12B is a flowchart illustrating an example of downloading contentin accordance with the present invention;

FIG. 13 is a flowchart illustrating another example of completing acontent download in accordance with the present invention;

FIG. 14A is a block diagram of an embodiment of a data storage structurein accordance with the present invention;

FIG. 14B is a block diagram of an embodiment of a data storage system inaccordance with the present invention;

FIG. 15A is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 15B is a flowchart illustrating an example of storing data inaccordance with the present invention;

FIG. 15C is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 15D is a flowchart illustrating another example of storing data inaccordance with the present invention;

FIG. 16 is a flowchart illustrating an example of updating stored datain accordance with the present invention; and

FIG. 17 is a flowchart illustrating an example of restoring data inaccordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of a computing system 10 thatincludes one or more of a first type of user devices 12, one or more ofa second type of user devices 14, at least one distributed storage (DS)processing unit 16, at least one DS managing unit 18, at least onestorage integrity processing unit 20, and a distributed storage network(DSN) memory 22 coupled via a network 24. The network 24 may include oneor more wireless and/or wire lined communication systems; one or moreprivate intranet systems and/or public internet systems; and/or one ormore local area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of distributed storage (DS) units36 for storing data of the system. Each of the DS units 36 includes aprocessing module and memory and may be located at a geographicallydifferent site than the other DS units (e.g., one in Chicago, one inMilwaukee, etc.).

Each of the user devices 12-14, the DS processing unit 16, the DSmanaging unit 18, and the storage integrity processing unit 20 may be aportable computing device (e.g., a social networking device, a gamingdevice, a cell phone, a smart phone, a personal digital assistant, adigital music player, a digital video player, a laptop computer, ahandheld computer, a video game controller, and/or any other portabledevice that includes a computing core) and/or a fixed computing device(e.g., a personal computer, a computer server, a cable set-top box, asatellite receiver, a television set, a printer, a fax machine, homeentertainment equipment, a video game console, and/or any type of homeor office computing equipment). Such a portable or fixed computingdevice includes a computing core 26 and one or more interfaces 30, 32,and/or 33. An embodiment of the computing core 26 will be described withreference to FIG. 2.

With respect to the interfaces, each of the interfaces 30, 32, and 33includes software and/or hardware to support one or more communicationlinks via the network 24 indirectly and/or directly. For example,interfaces 30 support a communication link (wired, wireless, direct, viaa LAN, via the network 24, etc.) between the first type of user device14 and the DS processing unit 16. As another example, DSN interface 32supports a plurality of communication links via the network 24 betweenthe DSN memory 22 and the DS processing unit 16, the first type of userdevice 12, and/or the storage integrity processing unit 20. As yetanother example, interface 33 supports a communication link between theDS managing unit 18 and any one of the other devices and/or units 12,14, 16, 20, and/or 22 via the network 24.

In general and with respect to data storage, the system 10 supportsthree primary functions: distributed network data storage management,distributed data storage and retrieval, and data storage integrityverification. In accordance with these three primary functions, data canbe distributedly stored in a plurality of physically different locationsand subsequently retrieved in a reliable and secure manner regardless offailures of individual storage devices, failures of network equipment,the duration of storage, the amount of data being stored, attempts athacking the data, etc.

The DS managing unit 18 performs distributed network data storagemanagement functions, which include establishing distributed datastorage parameters, performing network operations, performing networkadministration, and/or performing network maintenance. The DS managingunit 18 establishes the distributed data storage parameters (e.g.,allocation of virtual DSN memory space, distributed storage parameters,security parameters, billing information, user profile information,etc.) for one or more of the user devices 12-14 (e.g., established forindividual devices, established for a user group of devices, establishedfor public access by the user devices, etc.). For example, the DSmanaging unit 18 coordinates the creation of a vault (e.g., a virtualmemory block) within the DSN memory 22 for a user device (for a group ofdevices, or for public access). The DS managing unit 18 also determinesthe distributed data storage parameters for the vault. In particular,the DS managing unit 18 determines a number of slices (e.g., the numberthat a data segment of a data file and/or data block is partitioned intofor distributed storage) and a read threshold value (e.g., the minimumnumber of slices required to reconstruct the data segment).

As another example, the DS managing module 18 creates and stores,locally or within the DSN memory 22, user profile information. The userprofile information includes one or more of authentication information,permissions, and/or the security parameters. The security parameters mayinclude one or more of encryption/decryption scheme, one or moreencryption keys, key generation scheme, and data encoding/decodingscheme.

As yet another example, the DS managing unit 18 creates billinginformation for a particular user, user group, vault access, publicvault access, etc. For instance, the DS managing unit 18 tracks thenumber of times a user accesses a private vault and/or public vaults,which can be used to generate a per-access bill. In another instance,the DS managing unit 18 tracks the amount of data stored and/orretrieved by a user device and/or a user group, which can be used togenerate a per-data-amount bill.

The DS managing unit 18 also performs network operations, networkadministration, and/or network maintenance. As at least part ofperforming the network operations and/or administration, the DS managingunit 18 monitors performance of the devices and/or units of the system10 for potential failures, determines the devices' and/or units'activation status, determines the devices' and/or units' loading, andany other system level operation that affects the performance level ofthe system 10. For example, the DS managing unit 18 receives andaggregates network management alarms, alerts, errors, statusinformation, performance information, and messages from the devices12-14 and/or the units 16, 20, 22. For example, the DS managing unit 18receives a simple network management protocol (SNMP) message regardingthe status of the DS processing unit 16.

The DS managing unit 18 performs the network maintenance by identifyingequipment within the system 10 that needs replacing, upgrading,repairing, and/or expanding. For example, the DS managing unit 18determines that the DSN memory 22 needs more DS units 36 or that one ormore of the DS units 36 needs updating.

The second primary function (i.e., distributed data storage andretrieval) begins and ends with a user device 12-14. For instance, if asecond type of user device 14 has a data file 38 and/or data block 40 tostore in the DSN memory 22, it sends the data file 38 and/or data block40 to the DS processing unit 16 via its interface 30. As will bedescribed in greater detail with reference to FIG. 2, the interface 30functions to mimic a conventional operating system (OS) file systeminterface (e.g., network file system (NFS), flash file system (FFS),disk file system (DFS), file transfer protocol (FTP), web-baseddistributed authoring and versioning (WebDAV), etc.) and/or a blockmemory interface (e.g., small computer system interface (SCSI), internetsmall computer system interface (iSCSI), etc.). In addition, theinterface 30 may attach a user identification code (ID) to the data file38 and/or data block 40.

The DS processing unit 16 receives the data file 38 and/or data block 40via its interface 30 and performs a distributed storage (DS) process 34thereon (e.g., an error coding dispersal storage function). The DSprocessing 34 begins by partitioning the data file 38 and/or data block40 into one or more data segments, which is represented as Y datasegments. For example, the DS processing 34 may partition the data file38 and/or data block 40 into a fixed byte size segment (e.g., 2¹ to2^(n) bytes, where n=>2) or a variable byte size (e.g., change byte sizefrom segment to segment, or from groups of segments to groups ofsegments, etc.).

For each of the Y data segments, the DS processing 34 error encodes(e.g., forward error correction (FEC), information dispersal algorithm,or error correction coding) and slices (or slices then error encodes)the data segment into a plurality of error coded (EC) data slices 42-48,which is represented as X slices per data segment. The number of slices(X) per segment, which corresponds to a number of pillars n, is set inaccordance with the distributed data storage parameters and the errorcoding scheme. For example, if a Reed-Solomon (or other FEC scheme) isused in an n/k system, then a data segment is divided into n slices,where k number of slices is needed to reconstruct the original data(i.e., k is the threshold). As a few specific examples, the n/k factormay be 5/3; 6/4; 8/6; 8/5; 16/10.

For each EC slice 42-48, the DS processing unit 16 creates a uniqueslice name and appends it to the corresponding EC slice 42-48. The slicename includes universal DSN memory addressing routing information (e.g.,virtual memory addresses in the DSN memory 22) and user-specificinformation (e.g., user ID, file name, data block identifier, etc.).

The DS processing unit 16 transmits the plurality of EC slices 42-48 toa plurality of DS units 36 of the DSN memory 22 via the DSN interface 32and the network 24. The DSN interface 32 formats each of the slices fortransmission via the network 24. For example, the DSN interface 32 mayutilize an internet protocol (e.g., TCP/IP, etc.) to packetize the ECslices 42-48 for transmission via the network 24.

The number of DS units 36 receiving the EC slices 42-48 is dependent onthe distributed data storage parameters established by the DS managingunit 18. For example, the DS managing unit 18 may indicate that eachslice is to be stored in a different DS unit 36. As another example, theDS managing unit 18 may indicate that like slice numbers of differentdata segments are to be stored in the same DS unit 36. For example, thefirst slice of each of the data segments is to be stored in a first DSunit 36, the second slice of each of the data segments is to be storedin a second DS unit 36, etc. In this manner, the data is encoded anddistributedly stored at physically diverse locations to improve datastorage integrity and security.

Each DS unit 36 that receives an EC slice 42-48 for storage translatesthe virtual DSN memory address of the slice into a local physicaladdress for storage. Accordingly, each DS unit 36 maintains a virtual tophysical memory mapping to assist in the storage and retrieval of data.

The first type of user device 12 performs a similar function to storedata in the DSN memory 22 with the exception that it includes the DSprocessing. As such, the device 12 encodes and slices the data fileand/or data block it has to store. The device then transmits the slices11 to the DSN memory via its DSN interface 32 and the network 24.

For a second type of user device 14 to retrieve a data file or datablock from memory, it issues a read command via its interface 30 to theDS processing unit 16. The DS processing unit 16 performs the DSprocessing 34 to identify the DS units 36 storing the slices of the datafile and/or data block based on the read command. The DS processing unit16 may also communicate with the DS managing unit 18 to verify that theuser device 14 is authorized to access the requested data.

Assuming that the user device is authorized to access the requesteddata, the DS processing unit 16 issues slice read commands to at least athreshold number of the DS units 36 storing the requested data (e.g., toat least 10 DS units for a 16/10 error coding scheme). Each of the DSunits 36 receiving the slice read command, verifies the command,accesses its virtual to physical memory mapping, retrieves the requestedslice, or slices, and transmits it to the DS processing unit 16.

Once the DS processing unit 16 has received a read threshold number ofslices for a data segment, it performs an error decoding function andde-slicing to reconstruct the data segment. When Y number of datasegments has been reconstructed, the DS processing unit 16 provides thedata file 38 and/or data block 40 to the user device 14. Note that thefirst type of user device 12 performs a similar process to retrieve adata file and/or data block.

The storage integrity processing unit 20 performs the third primaryfunction of data storage integrity verification. In general, the storageintegrity processing unit 20 periodically retrieves slices 45, and/orslice names, of a data file or data block of a user device to verifythat one or more slices have not been corrupted or lost (e.g., the DSunit failed). The retrieval process mimics the read process previouslydescribed.

If the storage integrity processing unit 20 determines that one or moreslices is corrupted or lost, it rebuilds the corrupted or lost slice(s)in accordance with the error coding scheme. The storage integrityprocessing unit 20 stores the rebuild slice, or slices, in theappropriate DS unit(s) 36 in a manner that mimics the write processpreviously described.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface 60, at least one IO device interface module 62, a readonly memory (ROM) basic input output system (BIOS) 64, and one or morememory interface modules. The memory interface module(s) includes one ormore of a universal serial bus (USB) interface module 66, a host busadapter (HBA) interface module 68, a network interface module 70, aflash interface module 72, a hard drive interface module 74, and a DSNinterface module 76. Note the DSN interface module 76 and/or the networkinterface module 70 may function as the interface 30 of the user device14 of FIG. 1. Further note that the IO device interface module 62 and/orthe memory interface modules may be collectively or individuallyreferred to as IO ports.

FIG. 3 is a schematic block diagram of an embodiment of a dispersedstorage (DS) processing module 34 of user device 12 and/or of the DSprocessing unit 16. The DS processing module 34 includes a gatewaymodule 78, an access module 80, a grid module 82, and a storage module84. The DS processing module 34 may also include an interface 30 and theDSnet interface 32 or the interfaces 68 and/or 70 may be part of userdevice 12 or of the DS processing unit 16. The DS processing module 34may further include a bypass/feedback path between the storage module 84to the gateway module 78. Note that the modules 78-84 of the DSprocessing module 34 may be in a single unit or distributed acrossmultiple units.

In an example of storing data, the gateway module 78 receives anincoming data object that includes a user ID field 86, an object namefield 88, and the data object field 40 and may also receivecorresponding information that includes a process identifier (e.g., aninternal process/application ID), metadata, a file system directory, ablock number, a transaction message, a user device identity (ID), a dataobject identifier, a source name, and/or user information. The gatewaymodule 78 authenticates the user associated with the data object byverifying the user ID 86 with the DS managing unit 18 and/or anotherauthenticating unit.

When the user is authenticated, the gateway module 78 obtains userinformation from the management unit 18, the user device, and/or theother authenticating unit. The user information includes a vaultidentifier, operational parameters, and user attributes (e.g., userdata, billing information, etc.). A vault identifier identifies a vault,which is a virtual memory space that maps to a set of DS storage units36. For example, vault 1 (i.e., user 1's DSN memory space) includeseight DS storage units (X=8 wide) and vault 2 (i.e., user 2's DSN memoryspace) includes sixteen DS storage units (X=16 wide). The operationalparameters may include an error coding algorithm, the width n (number ofpillars X or slices per segment for this vault), a read threshold T, awrite threshold, an encryption algorithm, a slicing parameter, acompression algorithm, an integrity check method, caching settings,parallelism settings, and/or other parameters that may be used to accessthe DSN memory layer.

The gateway module 78 uses the user information to assign a source name35 to the data. For instance, the gateway module 78 determines thesource name 35 of the data object 40 based on the vault identifier andthe data object. For example, the source name may contain a fileidentifier (ID), a vault generation number, a reserved field, and avault identifier (ID). As another example, the gateway module 78 maygenerate the file ID based on a hash function of the data object 40.Note that the gateway module 78 may also perform message conversion,protocol conversion, electrical conversion, optical conversion, accesscontrol, user identification, user information retrieval, trafficmonitoring, statistics generation, configuration, management, and/orsource name determination.

The access module 80 receives the data object 40 and creates a series ofdata segments 1 through Y 90-92 in accordance with a data storageprotocol (e.g., file storage system, a block storage system, and/or anaggregated block storage system). The number of segments Y may be chosenor randomly assigned based on a selected segment size and the size ofthe data object. For example, if the number of segments is chosen to bea fixed number, then the size of the segments varies as a function ofthe size of the data object. For instance, if the data object is animage file of 4,194,304 eight bit bytes (e.g., 33,554,432 bits) and thenumber of segments Y=131,072, then each segment is 256 bits or 32 bytes.As another example, if segment size is fixed, then the number ofsegments Y varies based on the size of data object. For instance, if thedata object is an image file of 4,194,304 bytes and the fixed size ofeach segment is 4,096 bytes, then the number of segments Y=1,024. Notethat each segment is associated with the same source name.

The grid module 82 receives the data segments and may manipulate (e.g.,compression, encryption, cyclic redundancy check (CRC), etc.) each ofthe data segments before performing an error coding function of theerror coding dispersal storage function to produce a pre-manipulateddata segment. After manipulating a data segment, if applicable, the gridmodule 82 error encodes (e.g., Reed-Solomon, Convolution encoding,Trellis encoding, etc.) the data segment or manipulated data segmentinto X error coded data slices 42-44.

The value X, or the number of pillars (e.g., X=16), is chosen as aparameter of the error coding dispersal storage function. Otherparameters of the error coding dispersal function include a readthreshold T, a write threshold W, etc. The read threshold (e.g., T=10,when X=16) corresponds to the minimum number of error-free error codeddata slices required to reconstruct the data segment. In other words,the DS processing module 34 can compensate for X-T (e.g., 16−10=6)missing error coded data slices per data segment. The write threshold Wcorresponds to a minimum number of DS storage units that acknowledgeproper storage of their respective data slices before the DS processingmodule indicates proper storage of the encoded data segment. Note thatthe write threshold is greater than or equal to the read threshold for agiven number of pillars (X).

For each data slice of a data segment, the grid module 82 generates aunique slice name 37 and attaches it thereto. The slice name 37 includesa universal routing information field and a vault specific field and maybe 48 bytes (e.g., 24 bytes for each of the universal routinginformation field and the vault specific field). As illustrated, theuniversal routing information field includes a slice index, a vault ID,a vault generation, and a reserved field. The slice index is based onthe pillar number and the vault ID and, as such, is unique for eachpillar (e.g., slices of the same pillar for the same vault for anysegment will share the same slice index). The vault specific fieldincludes a data name, which includes a file ID and a segment number(e.g., a sequential numbering of data segments 1-Y of a simple dataobject or a data block number).

Prior to outputting the error coded data slices of a data segment, thegrid module may perform post-slice manipulation on the slices. Ifenabled, the manipulation includes slice level compression, encryption,CRC, addressing, tagging, and/or other manipulation to improve theeffectiveness of the computing system.

When the error coded data slices of a data segment are ready to beoutputted, the grid module 82 determines which of the DS storage units36 will store the EC data slices based on a dispersed storage memorymapping associated with the user's vault and/or DS storage unitattributes. The DS storage unit attributes may include availability,self-selection, performance history, link speed, link latency,ownership, available DSN memory, domain, cost, a prioritization scheme,a centralized selection message from another source, a lookup table,data ownership, and/or any other factor to optimize the operation of thecomputing system. Note that the number of DS storage units 36 is equalto or greater than the number of pillars (e.g., X) so that no more thanone error coded data slice of the same data segment is stored on thesame DS storage unit 36. Further note that EC data slices of the samepillar number but of different segments (e.g., EC data slice 1 of datasegment 1 and EC data slice 1 of data segment 2) may be stored on thesame or different DS storage units 36.

The storage module 84 performs an integrity check on the outboundencoded data slices and, when successful, identifies a plurality of DSstorage units based on information provided by the grid module 82. Thestorage module 84 then outputs the encoded data slices 1 through X ofeach segment 1 through Y to the DS storage units 36. Each of the DSstorage units 36 stores its EC data slice(s) and maintains a localvirtual DSN address to physical location table to convert the virtualDSN address of the EC data slice(s) into physical storage addresses.

In an example of a read operation, the user device 12 and/or 14 sends aread request to the DS processing unit 16, which authenticates therequest. When the request is authentic, the DS processing unit 16 sendsa read message to each of the DS storage units 36 storing slices of thedata object being read. The slices are received via the DSnet interface32 and processed by the storage module 84, which performs a parity checkand provides the slices to the grid module 82 when the parity check wassuccessful. The grid module 82 decodes the slices in accordance with theerror coding dispersal storage function to reconstruct the data segment.The access module 80 reconstructs the data object from the data segmentsand the gateway module 78 formats the data object for transmission tothe user device.

FIG. 4 is a schematic block diagram of an embodiment of a grid module 82that includes a control unit 73, a pre-slice manipulator 75, an encoder77, a slicer 79, a post-slice manipulator 81, a pre-slice de-manipulator83, a decoder 85, a de-slicer 87, and/or a post-slice de-manipulator 89.Note that the control unit 73 may be partially or completely external tothe grid module 82. For example, the control unit 73 may be part of thecomputing core at a remote location, part of a user device, part of theDS managing unit 18, or distributed amongst one or more DS storageunits.

In an example of write operation, the pre-slice manipulator 75 receivesa data segment 90-92 and a write instruction from an authorized userdevice. The pre-slice manipulator 75 determines if pre-manipulation ofthe data segment 90-92 is required and, if so, what type. The pre-slicemanipulator 75 may make the determination independently or based oninstructions from the control unit 73, where the determination is basedon a computing system-wide predetermination, a table lookup, vaultparameters associated with the user identification, the type of data,security requirements, available DSN memory, performance requirements,and/or other metadata.

Once a positive determination is made, the pre-slice manipulator 75manipulates the data segment 90-92 in accordance with the type ofmanipulation. For example, the type of manipulation may be compression(e.g., Lempel-Ziv-Welch, Huffman, Golomb, fractal, wavelet, etc.),signatures (e.g., Digital Signature Algorithm (DSA), Elliptic Curve DSA,Secure Hash Algorithm, etc.), watermarking, tagging, encryption (e.g.,Data Encryption Standard, Advanced Encryption Standard, etc.), addingmetadata (e.g., time/date stamping, user information, file type, etc.),cyclic redundancy check (e.g., CRC32), and/or other data manipulationsto produce the pre-manipulated data segment.

The encoder 77 encodes the pre-manipulated data segment 92 using aforward error correction (FEC) encoder (and/or other type of erasurecoding and/or error coding) to produce an encoded data segment 94. Theencoder 77 determines which forward error correction algorithm to usebased on a predetermination associated with the user's vault, a timebased algorithm, user direction, DS managing unit direction, controlunit direction, as a function of the data type, as a function of thedata segment 92 metadata, and/or any other factor to determine algorithmtype. The forward error correction algorithm may be Golay,Multidimensional parity, Reed-Solomon, Hamming, Bose Ray ChauduriHocquenghem (BCH), Cauchy-Reed-Solomon, or any other FEC encoder. Notethat the encoder 77 may use a different encoding algorithm for each datasegment 92, the same encoding algorithm for the data segments 92 of adata object, or a combination thereof.

The encoded data segment 94 is of greater size than the data segment 92by the overhead rate of the encoding algorithm by a factor of X/T, whereX is the width or number of slices, and T is the read threshold. In thisregard, the corresponding decoding process can accommodate at most X-Tmissing EC data slices and still recreate the data segment 92. Forexample, if X=16 and T=10, then the data segment 92 will be recoverableas long as 10 or more EC data slices per segment are not corrupted.

The slicer 79 transforms the encoded data segment 94 into EC data slicesin accordance with the slicing parameter from the vault for this userand/or data segment 92. For example, if the slicing parameter is X=16,then the slicer 79 slices each encoded data segment 94 into 16 encodedslices.

The post-slice manipulator 81 performs, if enabled, post-manipulation onthe encoded slices to produce the EC data slices. If enabled, thepost-slice manipulator 81 determines the type of post-manipulation,which may be based on a computing system-wide predetermination,parameters in the vault for this user, a table lookup, the useridentification, the type of data, security requirements, available DSNmemory, performance requirements, control unit directed, and/or othermetadata. Note that the type of post-slice manipulation may includeslice level compression, signatures, encryption, CRC, addressing,watermarking, tagging, adding metadata, and/or other manipulation toimprove the effectiveness of the computing system.

In an example of a read operation, the post-slice de-manipulator 89receives at least a read threshold number of EC data slices and performsthe inverse function of the post-slice manipulator 81 to produce aplurality of encoded slices. The de-slicer 87 de-slices the encodedslices to produce an encoded data segment 94. The decoder 85 performsthe inverse function of the encoder 77 to recapture the data segment90-92. The pre-slice de-manipulator 83 performs the inverse function ofthe pre-slice manipulator 75 to recapture the data segment 90-92.

FIG. 5 is a diagram of an example of slicing an encoded data segment 94by the slicer 79. In this example, the encoded data segment 94 includesthirty-two bits, but may include more or less bits. The slicer 79disperses the bits of the encoded data segment 94 across the EC dataslices in a pattern as shown. As such, each EC data slice does notinclude consecutive bits of the data segment 94 reducing the impact ofconsecutive bit failures on data recovery. For example, if EC data slice2 (which includes bits 1, 5, 9, 13, 17, 25, and 29) is unavailable(e.g., lost, inaccessible, or corrupted), the data segment can bereconstructed from the other EC data slices (e.g., 1, 3 and 4 for a readthreshold of 3 and a width of 4).

FIG. 6 is a schematic block diagram of another embodiment of a computingsystem. The computing system includes a plurality of content providers1-C, a dispersed storage (DS) processing unit 16, a network 24, adispersed storage network (DSN) memory 22, a wireless controller 102, abase station 108, a wireless router 104, a distribution server 106, aplurality of user devices 12, a wireless transceiver 112, a low tieruser device 114, and a plurality of wireless user devices 110. The DSNmemory 22 includes a plurality of DS units 36. The wireless controller102, wireless router 104, distribution server 106, user device 12, andthe wireless user device 110 may include a slice memory (SM) 116. Theslice memory 116 includes a temporary slice memory when undertaking(e.g., for storing encoded data slices on a temporary basis) and anon-temporary slice memory 120 (e.g., for storing encoded data slices ona non-temporary basis).

Each content provider of the content providers 1-C aggregates and storescontent 122 for distribution to one or more of the user devices (e.g.,low tier user device 114, user device 12, wireless user device 110). Thecontent 122 includes one or more of multimedia, video, movies, music,audio recordings, pictures, sound files, image files, applications, andsoftware. The content 122 may be associated with a content descriptorincluding one or more of a content type, a genre type, an artist, amovie type, a music type, a release date, pricing information, purchaseindicator information, a demographic indicator, a favorite syndicator, aquality rating, and an industry rating. The descriptor may be includedwith the content 122.

The DS processing unit 16 is operable to ingest content 122 by receivingthe content 122 from at least one of the content providers 1-C,dispersed storage error encode at least some of the content 122 toproduce slices, and send the slices to the DSN memory 22 for storage inat least some of the DS units 36. The DS processing unit 16 is furtheroperable to distribute the content 122 by one or more of receiving acontent request, facilitating sending of slices 11 associated with thecontent 122 of the request to a requesting entity (e.g., a user device),determining target content for a user device, facilitating temporarilystoring some slices 11 (e.g., a first sub-set of public pillar slices)associated with the target content in the user device, and facilitatingsending other slices 11 (e.g., second sub-sub of private pillar slices)associated with target content to the user device when the user devicerequests the target content.

The wireless controller 102 is operable to control the base station 108such that the base station 108 converts slices 11 to wide-area signals124 for transmission to one or more wireless user devices 110. The basestation 108 may operate in accordance with one or more industrystandards (e.g., global system for mobile communications (GSM), codedivision multiple access (CDMA), etc.) and is operable to transmit andreceive wide-area signals. The wireless router 104 is operable toconvert slices 11 into local area signals 126 for transmission to one ormore wireless user devices 110. The wireless router 104 may operate inaccordance with one or more industry standards (e.g., WIFI, Bluetooth,etc.) to transmit and receive the local area signals 126.

The distribution server 106 is operable to distribute slices 11 (e.g.,via a wireline or wireless connection) to one or more of the wirelesstransceiver 112, the low tier user device 114, and the user device 12.The wireless transceiver 112 is operable to convert slices 11 into localarea signals 126 for transmission to one or more wireless user devices110. The wireless transceiver 112 may operate in accordance with one ormore industry standards (e.g., WIFI, Bluetooth, etc.) to transmit andreceive the local area signals 126.

The user device 12 and low tier user device 114 include wirelinecommunication capability (e.g., a wireline interface). The wireless userdevice 110 includes a wireless transceiver and is operable tocommunicate wide area signals 124 and/or local area signals 126 with oneor more of another wireless user device 110, the base station 108, thewireless router 104, and the wireless transceiver 112. The user device12, low tier user device 114, and wireless user device 110 are operableto communicate with the computing system via one or more of the basestation 108, the wireless router 104, the wireless transceiver 112, thedistribution server 106, and the network 24 to receive public pillarslices for at least temporary storage, request target content, andreceive private pillar slices for non-temporary storage.

The user device 12, low tier user device 114, and wireless user device110 includes a DS processing and is operable to temporarily store publicpillar slices, delete temporarily stored public pillar slices when suchslices are not required, store private pillar slices, dispersed storageerror decode slices into target content, dispersed storage error encodetarget content into slices, transcode slices that were encoded with afirst set of dispersal parameters into slices encoded with a second setof dispersal parameters, determine user content preferences, identifytarget content, facilitate requesting target content, facilitate sharingtarget content, and consume target content (e.g., playing a movie,playing a music file, etc.)

In an example of operation, a wireless user device 110 and is operablycoupled to the base station 108 and determines a user content preferenceand identifies target content associated with the user contentpreference. The wireless user device 110 identifies public pillarscorresponding to the target content for a partial download. The wirelessuser device 110 determines a partial downloading schedule (e.g., sendingslices on off hours such that base station effectiveness is notcompromised) for retrieving public pillar encoded data slicescorresponding to the public pillars. The wireless user device 110facilitates partial downloading of the target content by facilitatingsending of the public pillar encoded data slices 11 to the wireless userdevice 110 via the wireless controller 102 and the base station 108utilizing the wide-area signals 124. For example, the wireless userdevice 110 sends a slice retrieval request to the DSN memory 22, whereinthe request includes a slice name associated with a public pillarencoded data slice. Alternatively, or in addition to, the DS processingunit 16 determines the user content preference, identifies the targetcontent, identifies the public pillars, determines the partialdownloading schedule, and facilitates partial downloading of the targetcontent.

In the example continued, the wireless user device 110 receives thepublic pillar encoded slices, via the wide area signals 124, of thetarget content and stores the slices 11 in temporary slice memory 118 ofthe wireless user device 110. Next, the wireless user device 110determines whether the target content is desired. For example, thewireless user device 110 receives a user input that selects the targetcontent to indicate that the target content is desired target content.When the target content is desired, the wireless user device 110identifies one or more required private pillars of the desired targetcontent and requests encoded data slices (e.g., from the DSN memory 22)corresponding to the one or more required private pillars, receives theprivate pillar encoded data slices via the wide area signals, stores theprivate pillar encoded data slices in non-temporary slice memory 120,and moves the public pillar encoded data slices from the temporary slicememory 118 to the non-temporary slice memory 120 of the wireless userdevice 110.

In another example of operation, a wireless user device 110 is operablycoupled to the wireless router 104 and communicates with the DSN memory22 via the wireless router 104 utilizing the local area signals 126. Thewireless user device 110 may forward at least some of the public pillarencoded data slices to another wireless user device 110 operably coupledto the wireless user device 110 utilizing local area signals 126. In yetanother example of operation, the low tier user device 114communications with the DSN memory 22 via the distribution server 106utilizing a wireline connection and facilitates storage of public pillarencoded data slices and private pillar encoded data slices in a slicememory 116 of the distribution server 106. As such, the low tier userdevice 114 accesses the slice memory 116 of the distribution server 106to consume slices 11 as target content.

As yet another example of operation, the DS processing unit 16 selects aplurality of network edge units for staging public pillar encoded dataslices. The plurality of network edge units includes one or more of thewireless controller 102, the wireless router 104, the distributionserver 106, a user device 12, and a wireless user device 110. The DSprocessing unit 16 identifies target content for partial download to theplurality of network edge units. The DS processing unit 16 identifiespublic pillars corresponding to the target content for partial downloadand determines a partial downloading schedule for sending public pillarencoded data slices to each network edge unit of the plurality ofnetwork edge units. The DS processing unit 16 facilitates partialdownloading of the target content by facilitating sending of the publicpillar encoded data slices to each network edge unit of the plurality ofnetwork edge units.

In a continuation of the example, at least one of a user device 12 and awireless user device 110 identify target content and identify publicpillars corresponding to the target content. The at least one of theuser device 12 and the wireless user device 110 requests a download ofthe public pillar encoded data slices from at least one of the pluralityof network edge units. The at least one of the user device 12 andwireless user device 110 receives the public pillar encoded data slicesof the target content and stores the public pillar encoded data slicesin temporary slice memory 118 associated with the at least one of theuser device 12 and the wireless user device 110. The at least one of theuser device 12 and the wireless user device 110 downloads correspondingprivate pillar encoded data slices from at least one of the DSN memory22 and one of the plurality of network edge units and stores the privatepillar encoded data slices in non-temporary slice memory 120 associatedwith the at least one of the user device 12 and the wireless user device110. The at least one of the user device 12 and the wireless user device110 transfers the public pillar encoded data slices from the temporaryslice memory 118 to the non-temporary slice memory 120. The method ofoperation of the computing system is described in greater detail withreference to FIGS. 7A-13.

FIG. 7A is a flowchart illustrating an example of verifying storedcontent. The method begins at step 128 where a processing module (e.g.,a user device) identifies content slices and associated slice namesstored in a slice memory. The identifying may be based on one or more ofa data type indicator, a directory name, a filename extension, a slicepattern analysis, a comparison to a content slice, and a comparison of ahash of a slice to a content slice hash. For example, processing moduleidentifies a slice as a content slice when an associated directory nameincludes a video filename extension.

The method continues at step 130 where the processing module analyzesthe content slices to produce slice analysis information. The sliceanalysis information includes one or more of a user device identifier(ID), a content ID, a content type indicator, a content owner indicator,a vault ID, a content license, a content size indicator, a number ofdata segments indicator, a number of data slices indicator, a slice sizeindicator, and a slice name. Such analyzing may be based on one or moreof slice names associated with the content slices, pillar numbersextracted from the slice names, data segment IDs extracted from theslice names, content of a segment allocation table, header informationfrom a first data segment of content, counting a number of slices, andcounting the number of bytes. The method continues at step 132 where theprocessing module sends the slice analysis information to a contentserver.

FIG. 7B is a flowchart illustrating another example of verifying storedcontent. The method begins at step 134 where a processing module (e.g.,of a dispersed storage (DS) processing unit) receives slice analysisinformation (e.g., from a user device). The method continues at step 136where the processing module determines an allowed content identifier(ID) for the user device based on the slice analysis information. Thedetermination may be based on one or more of a user ID, a content ID, apermissions table lookup, a DS managing unit query, a content IDassociated with the decode threshold number of slices, and a contentlicense. For example, the processing module determines that content ID457 is an allowed content ID for user ID 300 when the slice analysisinformation indicates that a decode threshold number of slices forcontent ID 457 are stored by user device 300. As another example, theprocessing module determines that content ID 505 is an allowed contentID for user ID 300 when the slice analysis information indicates thatuser ID 300 possesses a content license for content ID 505. As yetanother example, the processing module determines that content ID 739 isan allowed content ID for user ID 300 when the permissions table lookupindicates that user ID 300 is allowed to possess content ID 739.

The method continues at step 138 where the processing module updates auser record to include at least a portion of the slice analysisinformation and the allowed content ID. The user record includesauthentication information utilized in authenticating dispersed storagenetwork (DSN) resource requests. For example, the processing moduleupdates the user record to include an indication of which pillars ofallowed content are stored at the user device and which pillars of theallowed content are allowable as an allowed combination. The allowedcombination include an allowable subset of pillars of each data segmentof a plurality of data segments of the allowed content, wherein theallowable subset of pillars is at least a decode threshold number and amost a pillar width number. The allowable subset of pillars may includea different subset of pillars for each data segment of the plurality ofdata segments. The allowed pillar combination may be determined by apillar assignment method such that each user device is associated with aunique allowed pillar combination. Alternatively, the pillar assignmentmethod may produce allowed pillar combinations that are shared amongst apredetermined number of user devices.

In an authenticating a DSN resource request example of operation, theprocessing module receives a content request from a user device, whereinthe request includes a content ID and a user ID. The processing moduleaccesses the user record based on the user ID. The processing moduleutilizes the user record for the user ID to determine whether the userdevice is allowed to access the content.

FIG. 8A is a schematic block diagram of another embodiment of acomputing system that includes a computing device 140 and an accessingdevice 142. The computing device 140 may be implemented as a dispersedstorage (DS) processing unit, a user device, and/or a DS unit. Theaccessing device 142 may be implemented as a user device, a DS unit,and/or another DS processing unit. For example, the computing device 140is a DS processing unit commissioned to distribute multi-media content166 to a user device as the accessing device 142. The computing device140 includes a DS module 144 which includes a determine whether todownload module 146, a determine user slice set module 148, a determinematched slices module 150, and a send slices module 152.

The accessing device 142 receives, during a pre-download process of themulti-media content 166, a partial set of encoded data slices of a setof encoded data slices produced by dispersed storage error encoding adata segment of the multi-media content 166. The determine whether todownload module 146 determines whether to complete downloading of thedata segment to the accessing device 142. The determining whether tocomplete downloading of the data segment includes polling the accessingdevice regarding accessing the multi-media content 166, receiving acontent request 154 from the accessing device, and/or identifying adownloading schedule associated with the accessing device.

The determine user slice set module 148 determines, for the accessingdevice, a user set of encoded data slices, which includes first andsecond sub-sets of encoded data slices of the set of encoded data slicessuch that the first sub-set of encoded data slices includes less than adecode threshold number of encoded data slices. The first and secondsub-sets of encoded data slices may include less encoded data slicesthan the set of encoded data slices. The determine user slice set module148 may determine the user set of encoded data slices by accessing anauthorized accessing list for the multi-media content 166.

The determine matched slices module 150 determines whether encoded dataslices of the partial set of encoded data slices substantially matchesencoded data slices of the first sub-set of encoded data slices. Thedetermine matched slices module 150 determines whether the encoded dataslices of the partial set of encoded data slices substantially matchesthe encoded data slices of the first sub-set of encoded data slices byobtaining a slice name list 156 that includes slice names of encodeddata slices in the partial set of encoded data slices and comparing theslice name list 156 to slice names of the first sub-set of encoded dataslices. The determine matched slices module 150 obtains the slice namelist 156 by receiving the slice name list 156 and/or requesting theslice name list 156. The requesting the slice name list 156 includesissuing, to the accessing device, a slice name list request regardingthe partial set of encoded data slices and receiving the slice name list156.

When the comparing the slice name list 156 to slice names of the firstsub-set of encoded data slices indicates that the encoded data slices ofthe partial set of encoded data slices substantially matches encodeddata slices of the first sub-set of encoded data slices, the send slicesmodule 152 sends the second sub-set of encoded data slices to theaccessing device 142. For example, the send slices module 152 retrievesthe second sub-set of encoded data slices 158 from a dispersed storagenetwork (DSN) memory and outputs the second sub-set of encoded dataslices 158 to the accessing device 142. As another example, some slicesmodule 152 encodes the data segment of the multi-media content 166utilizing a dispersed storage error coding function to produce thesecond sub-set encoded data slices 158 and outputs the second sub-soencoded data slices 158 to the accessing device 142.

When the encoded data slice of the partial set of encoded data slicesdoes not substantially match encoded data slices of the first sub-set ofencoded data slices, the determine matched slices module 150 determineswhether the partial set of encoded data slices includes an encoded dataslice that is not part of the first sub-set of encoded data slices(e.g., not part when a slice name of the encoded data slice does notmatch any slice name of the first sub-set of encoded data slices). Whenthe partial set of encoded data slices does not include the encoded dataslice the determine matched slices module 150 determines a missingencoded data slice 160 based on a comparison of the partial set ofencoded data slices and the first sub-set of encoded data slices and thesend slices module 152 sends the missing encoded data slice 160 and thesecond sub-set of encoded data slices 158 to the accessing device 142.

When the partial set of encoded data slices includes the encoded dataslice that is not part of the first sub-set of encoded data slices, thedetermine matched slices module 150 determines a course of action forthe downloading. The course of action includes sending remaining encodeddata slices 162 of the second sub-set of encoded data slices 158,sending a message 164 to delete the encoded data slice that is not partof the first sub-sub encoded data slices, and/or sending a deletemessage 164 regarding the partial set of encoded data slices. Forexample, the determine matched slices module 150 determines the courseof action based on determining whether the encoded data slice that isnot part of the first sub-set of encoded data slices is part of thesecond sub-set of encoded data slices 158 (e.g., comparing slice names).When the encoded data slice that is not part of the first sub-set ofencoded data slices is part of the second sub-set of encoded data slices158, the send slices module 152 sends remaining encoded data slices 162of the second sub-set of encoded data slices 158. When the encoded dataslice that is not part of the first sub-set of encoded data slices isnot part of the second sub-set of encoded data slices 158, the sendslices module 152 sends the second sub-set of encoded data slices 158and sends a message 164 to delete the encoded data slice that is notpart of the first sub-set of encoded data slices.

As another example, the send slices module 152 determines the course ofaction as sending a delete message 164 regarding the partial set ofencoded data slices based on a slice name of the encoded data slice thatis not part of the first sub-set of encoded data slices. For instance,the send slices module 152 sends the delete message 164 regarding thepartial set of encoded data slices when the encoded data slice that isnot part of the first sub-set of encoded data slices is not part of thesecond sub-set of encoded data slices 158 and is part of the set ofencoded data slices.

As yet another example, the send slices module 152 determines the courseof action based on determining how the encoded data slice that is notpart of the first sub-set of encoded data slices was obtained by theaccessing device. When the encoded data slice that is not part of thefirst sub-set of encoded data slices was obtained in an authorizedmanner, the send slices module 152 sends the second sub-set of encodeddata slices 158 to the accessing device 142. When the encoded data slicethat is not part of the first sub-set of encoded data slices wasobtained in an unauthorized manner, the send slices module 152 sends thedelete message 164 regarding the partial set of encoded data slices.

FIG. 8B is a flowchart illustrating an example of completing a contentdownload. The method begins at step 170 where a processing module (e.g.,of a dispersed storage (DS) processing unit) determines whether tocomplete downloading of a data segment of multi-media content to anaccessing device. The data segment is encoded utilizing a dispersedstorage error coding function to produce a set of encoded data slicesand the accessing device receives a partial set of encoded data slicesof the set of encoded data slices during a pre-download process of themultimedia content.

When the downloading is to be completed, the method continues at step172 where the processing module determines, for the accessing device, auser set of encoded data slices for accessing the data segment. The userset of encoded data slices includes first and second sub-sets of encodeddata slices of the set of encoded data slices. The first sub-set ofencoded data slices includes less than a decode threshold number ofencoded data slices. The first and second sub-sets of encoded dataslices may include less encoded data slices than the set of encoded dataslices. The determining includes accessing an authorized accessing listfor the multi-media content.

The method continues at step 174 where the processing module determineswhether encoded data slices of the partial set of encoded data slicessubstantially matches encoded data slices of the first sub-set ofencoded data slices. The determining includes issuing, to the accessingdevice, a slice name list request regarding the partial set of encodeddata slices and receiving a slice name list that includes slice names ofthe encoded data slices in the partial set of encoded data slices. Themethod branches to step 178 when there is no match. The method continuesto step 176 when there is a match. The method continues at step 176where the processing module sends the second sub-set of encoded dataslices to the accessing device. The sending includes obtaining thesecond sub-set of encoded data slices to include generating the secondsub-set of encoded data slices and/or retrieving the second sub-set ofencoded data slices.

The method continues at step 178 where the processing module determineswhether the partial set of encoded data slices includes an encoded dataslice that is not part of the first sub-set of encoded data slices. Themethod branches to step 184 when the partial set of encoded data slicesincludes the encoded data slice that is not part of the first sub-subencoded data slices. The method continues to step 180 when the partialset of encoded data slices does not include the encoded data slice thatis not part of the first sub-sub encoded data slices. The methodcontinues at step 180 where the processing module determines a missingencoded data slice (e.g., of the first sub-set of encoded data slices)based on a comparison of the partial set of encoded data slices and thefirst sub-set of encoded data slices. The method continues at step 182where the processing module sends the missing encoded data slice and thesecond sub-set of encoded data slices to the accessing device.

The method continues at step 184 where the processing module determinesa course of action for the downloading when the partial set of encodeddata slices includes the encoded data slice that is not part of thefirst sub-set of encoded data slices. Such a course of action includesat least one of the first course of action, a second course of action,and a third course of action. The determining of the course of actionincludes selecting at least one of the first, second, and third courseof action and may be based on one or more of a security concern level,an authorization level of the accessing device, and the partial set ofencoded data slices. For example, the processing module selects thefirst course of action to align with a strategic objective to supply thesecond sub-set of encoded data slices to the accessing device whensecurity issues are of a lesser concern. As another example, theprocessing module selects the second course of action to align with astrategic objective to interrupt the downloading of the data segment onesecurity issues are of a greatest concern. As yet another example, theprocessing module selects the third course of action to align with astrategic objective to complete the download in accordance with anauthorization level of the accessing device.

When the processing module selects the first course of action, themethod continues at step 186 where the processing module determineswhether the encoded data slice that is not part of the first sub-set ofencoded data slices is part of the second sub-set of encoded dataslices. The method branches to step 190 when the processing moduledetermines that the encoded data slice is not part of the second sub-setof encoded slices. The method continues to step 188 when the processingmodule determines that the encoded data slice is part of the secondsub-set of encoded slices. The method continues at step 188 where theprocessing module sends remaining encoded data slices of the secondsub-set of encoded data slices to the accessing device.

When the encoded data slices that is not part of the first sub-set ofencoded data slices is not part of the second sub-set of encoded dataslices, the method continues at step 190 where the processing modulesends a message to delete the encoded data slice that is not part of thefirst sub-set of encoded data slices. The method branches to step 176where the processing module sends the second sub-set of encoded dataslices to the accessing device.

When the processing module selects the second course of action, themethod continues at step 192 where the processing module sends a deletemessage regarding the partial set of encoded data slices to theaccessing device to facilitate deletion of the partial set of encodeddata slices. When the processing module selects the third course ofaction, the method continues at step 194 where the processing moduledetermines how the encoded data slice that is not part of the firstsub-set of encoded data slices was obtained by the accessing device. Thedetermining includes at least one of issuing a query to the accessingdevice, retrieving a slice transfer logging record, issuing a query toanother accessing device, identifying a revision number associated withthe encoded data slice, and retrieving the encoded data slice to extracta watermark. The obtaining of the encoded data slice by the accessingdevice includes an authorized manner and an unauthorized manner. Forexample, the processing module identifies the authorized manner when therevision number compares favorably to a list of authorized revisionnumbers in accordance with a content purchase agreement for theaccessing device. As another example, the processing module identifiesthe unauthorized manner when the slice transfer logging record indicatesthat the accessing device received the encoded data slice from anunauthorized source.

When the encoded data slice that is not part of the first sub-set ofencoded data slices was obtained in an authorized manner, the methodbranches to step 176 where the processing module sends the secondsub-set of encoded data slices to the accessing device. When the encodeddata slices that is not part of the first sub-set of encoded data sliceswas obtained in an unauthorized manner, the method continues to step 192where the processing module sends the delete message regarding thepartial set of encoded data slices to the accessing device.

FIG. 9 is a flowchart illustrating another example of completing acontent download. The method begins at step 200 where a processingmodule (e.g., of a user device) determines stored pillars. The storedpillars indicate which pillars of slices that the user device alreadypossesses (e.g., from a previous download process). At least some of thestored pillars may not be included in an allowed pillar combination. Thedetermination may be based on one or more of a query, a user recordlookup, and slice analysis information of the user device. For example,the processing module determines that pillars 1 and 3 are included inthe stored pillars when the slice analysis information indicates thatpillars 1 in 3 are stored at the user device.

The method continues at step 202 where the processing module determinesan allowed pillar combination. The determination may be based on one ormore of assigning a new allowed pillar combination from a plurality ofunassigned allowed pillar combinations, a user record lookup, and sliceanalysis information associated with the user device. For example, theprocessing module assigns an allowed pillar combination that includespillars 1, 3, and 4 when a pillar width is 5 and a decode threshold is3. There are 10 ways to choose 3 pillars from 5. Note that there aremany more ways to choose a decode threshold number of pillars from apillar width number of pillars when the difference between the decodethreshold in the pillar width is larger. For example, there are 8,008ways to choose 10 pillars from 16 enabling 8,008 user devices to beassigned a unique allowed pillar combination. As another example, thereare over 64 million ways to choose 10 pillars from 32 enabling over 64million user devices to be assigned a unique allowed pillar combination.

The method continues at step 204 where the processing module determinesincremental pillars based on the stored pillars and the allowed pillarcombination. The incremental pillars include pillars of the allowedpillar combination that are not already stored in the user device. Forexample, the processing module determines the incremental pillars toinclude pillar 4 when pillars 1, 3, and 4 are the allowed pillars andpillars 1 and 3 are the stored pillars.

The method continues at step 206 where the processing module obtains theincremental pillars. The obtaining includes at least one of requestingthe incremental pillars and receiving the incremental pillars. Themethod continues at step 208 where the processing module identifiesnon-allowed stored slices. The non-allowed stored slices includes slicesof pillars that are not included in the allowed pillar combination. Theidentifying may be based on comparing the stored pillars to the allowedpillar combination. For example, the processing module identifies slicesof pillar 15 as non-allowed stored slices when the stored pillarsincludes pillars 1-8, and 15 and the allowed pillar combination includespillars 1-12.

The method continues at step 210 where the processing module deletes thenon-allowed stored slices. The deleting includes deleting the slicesfrom a slice memory and sending a delete request (e.g., to a dispersedstorage network memory). For example, the processing module deletes theslices of pillar 15 from a slice memory of a user device when the slicesof pillar 15 are included in the non-allowed stored slices.

FIG. 10 is a flowchart illustrating another example of completing acontent download, which include similar steps to FIG. 9. The methodbegins with step 212 where a processing module (e.g., of a dispersedstorage (DS) processing unit) receives a play request for content from auser device. The play request includes one or more of a user deviceidentifier (ID) and a content ID. The method continues at step 214 wherethe processing module determines whether the user device is allowed toaccess the content. The determining is based on at least one of a userrecord lookup, utilizing the user device ID, and slice analysisinformation. For example, the processing module determines that the userdevice is allowed to access the content when the user record lookupindicates that the user device has permission to access content. Asanother example, the processing module determines that the user deviceis allowed to access the content when the slice analysis informationindicates that the user device includes a license to access the content.

The method branches to step 200 FIG. 9 where when the processing moduledetermines that the user device is allowed to access the content. Themethod continues to step 216 when the processing module determines thatthe user device is not allowed to access the content. The methodcontinues at step 216 where the processing module sends a reject message(e.g., to one or more of the user device and a DS managing unit). Thereject message may include one or more of a reject indicator, arejection reason indicator, the user ID, and the content ID.

When the user device is allowed to access the content, the methodcontinues with the steps of FIG. 9 where the processing moduledetermines stored pillars, determines an allowed pillar combination, anddetermines incremental pillars based on the stored pillars and theallowed pillar combination. The method continues at step 224 where theprocessing module streams slices associated with the incremental pillarsto the user device. The streaming includes sending slices of theincremental pillars segment by segment in an order starting with a firstsegment. The slices of incremental pillars may vary in pillar numbersegment by segment.

FIG. 11A is a schematic block diagram of another embodiment of acomputing system that includes a computing device 230 and plurality ofuser devices 232. The computing device 230 may be implemented as adispersed storage (DS) processing unit, a user device, and/or a DS unit.The computing device 230 may distribute multi-media content 166 to theplurality of user devices 232 in accordance with release of themulti-media content 166 for distribution. For example, the computingdevice 230 is a DS processing unit commissioned to distribute a firstportion of the multi-media content 166 to a user device 232 prior torelease of the multi-media content 166 and to distribute a secondportion of the multi-media content 166 to the user device 232 subsequentto release of the multi-media content 166. The computing device 230includes a DS module 234 which includes a determine access prioritymodule 236, a select distribution protocols module 238, and adistribution module 240.

The determine access priority module 236 determines, for multi-mediacontent 166 that has not been released, access priority 244 for the userdevice 232 utilizing a first or second approach. In a first approach todetermine access priority, the determine access priority module 236determines the access priority 244 by interpreting pre-order information242 of the user device 232 to identify a priority level of access to themulti-media content. For example, the determine access priority module236 interprets an active subscription to identify a medium prioritylevel of access. As another example, the determine access prioritymodule 236 interprets a pre-purchase order to identify a low prioritylevel of access. As yet another example, the determine access prioritymodule 236 interprets a premium purchase order to identify a highpriority level of access. The priority level of access includes two ormore of a data reliability indication (e.g., low, medium, high, etc.), adata resolution indication (e.g., low, medium, high, etc.), anavailability indicator (e.g., as soon as possible when released, withina day, for lowest cost), a distribution cost indicator (e.g.,willingness to pay a premium, a lowest-cost utilization indication), anda storage indicator (e.g., how much memory is available for thedownload).

The access priority 244 includes a pre-release access priority and apost-release access priority. For example, the pre-release accesspriority includes a low priority level of access when a distributioncost indicator indicates to utilize a lowest-cost approach. As anotherexample, the post-release access party level includes a high prioritylevel of access when an availability indicator identifies a fastestavailability as soon as the multi-media content 166 is released.

In a second approach to determine access priority, the determine accesspriority module 236 determines the access priority 244 by identifyingthe user device 232 as having a maintenance program for purchasedmulti-media content which includes an update to the purchasedmulti-media content. For example, the determine access priority module236 identifies the user device 232 to be associated with a purchase ofall future revisions of the multi-media content 166 based on a purchaselist lookup.

The select distribution protocols module 238 selects a pre-release datadistribution protocol based on the access priority 244 to produce aselected pre-release data distribution protocol 246 and selects apost-release data distribution protocol based on the access priority 244to produce a selected post-release data distribution protocol 248. Theselect distribution protocols module 238 selects the pre-release datadistribution protocol based on the pre-release access priority andselects the post-release data distribution protocol based on thepost-release access priority.

The pre-release data distribution protocol 246 includes two or more of anumber of encoded data slices to include in the first pre-releasesub-set (e.g., more slices per set for a higher access level and fewerfor a lower access level), a time frame for sending the plurality ofpre-release sub-sets to the user device (e.g., overnight, right away, afixed period of time later, after the release), a network connectionpreference to the user device (e.g., lowest cost connectivity, highestbandwidth connectivity), and an assurance level of the user devicereceiving the plurality of pre-release sub-sets prior to the release ofthe multi-media content. The post-release data distribution protocol 248includes two or more of a number of encoded data slices to include inthe first post-release sub-set (e.g., more slices per set for a higheraccess level and fewer for a lower access level), a time frame forsending the plurality of post-release sub-sets to the user device (e.g.,right away for a premium purchase, a fixed period of time later for aneconomy purchase, aligned with a time of consumption), a networkconnection preference to the user device (e.g., higher bandwidth for apremium purchase), and an assurance level of the user device receivingthe plurality of post-release sub-sets in a given time frame subsequentto the release of the multi-media content.

The distribution module 240 distributes pre-release sub-sets of encodeddata slices 250 to the user device in accordance with the selectedpre-release data distribution protocol 246. The multi-media content 166is dispersed storage error encoded to produce sets of encoded dataslices 254 which includes the pre-release sub-sets of encoded dataslices 250. Each pre-release sub-set includes less than a decodethreshold number of encoded data slices of a set of encoded data slices.The distributing includes at least one of generating the sets of encodeddata slices 254, retrieving the sets of encoded data slices 254 (e.g.,from a dispersed storage network memory), and selecting the pre-releasesub-sets of encoded data slices 250 in accordance with the selectedpre-release data distribution protocol 246. For example, thedistribution module 240 selects 9 encoded data slices of each set ofencoded data slices 254 to produce the pre-release sub-sets of encodeddata slices 250 when the decode threshold number is 10 and the selectedpre-release data distribution protocol 246 indicates to include amaximum number of encoded data slices for pre-distribution.

Subsequent to release of the multi-media content 166, the distributionmodule 240 distributes post-release sub-sets of encoded data slices 252to the user device in accordance with the selected post-release datadistribution protocol 248. Each post-release sub-set includes one ormore encoded data slices of the set of encoded data slices such that afirst pre-release sub-set and a first post-release sub-set includes atleast the decode threshold number of encoded data slices of the set ofencoded data slices. The distributing includes at least one ofgenerating the sets of encoded data slices 254, retrieving the sets ofencoded data slices 254, and selecting the post-release sub-sets ofencoded data slices 252 in accordance with the selected post-releasedata distribution protocol 248. For example, the distribution module 240selects 3 encoded data slices of each set of encoded data slices 254 toproduce the post-release sub-sets of encoded data slices 252 when thedecode threshold number is ten, nine slices per set were selected forthe pre-release sub-sets of encoded data slices, and the selectedpost-release data distribution protocol 248 indicates to include twomore encoded data slices than the decode threshold number forpost-distribution.

FIG. 11B is a flowchart illustrating an example of distributing content.The method begins at step 260 where a processing module (e.g., of adispersed storage (DS) processing unit) determines, for multi-mediacontent that has not been released, access priority for a user device.The access priority including a pre-release access priority and apost-release access priority. The determining the access priorityincludes at least one of interpreting pre-order information of the userdevice to identify one of a plurality of priority levels of access tothe multi-media content and identifying the user device as having amaintenance program for purchased multi-media content, wherein themulti-media content is an update to the purchased multi-media content.

The method continues at step 262 where the processing module selects oneof a plurality of pre-release data distribution protocols based on theaccess priority to produce a selected pre-release data distributionprotocol. The selecting includes selecting the one of the plurality ofpre-release data distribution protocols based on the pre-release accesspriority. The plurality of pre-release data distribution protocolsincludes two or more of a number of encoded data slices to include inthe first pre-release sub-set, a time frame for sending the plurality ofpre-release sub-sets to the user device, a network connection preferenceto the user device, and an assurance level of the user device receivingthe plurality of pre-release sub-sets prior to the release of themulti-media content.

The method continues at step 264 where the processing module selects oneof a plurality of post-release data distribution protocols based on theaccess priority to produce a selected post-release data distributionprotocol. The selecting includes selecting the one of the plurality ofpost-release data distribution protocols based on the post-releaseaccess priority. The plurality of post-release data distributionprotocols includes two or more of a number of encoded data slices toinclude in the first post-release sub-set, a time frame for sending theplurality of post-release sub-sets to the user device, a networkconnection preference to the user device, and an assurance level of theuser device receiving the plurality of post-release sub-sets in a giventime frame subsequent to the release of the multi-media content.

The method continues at step 266 where the processing module distributesa plurality of pre-release sub-sets of a plurality of sets of encodeddata slices to the user device in accordance with the selectedpre-release data distribution protocol. The distributing may includedispersed storage error encoding the multi-media content to produce theplurality of sets of encoded data slices. The first pre-release sub-setof the plurality of pre-release sub-sets may include less than a decodethreshold number of encoded data slices of a set of encoded data slicesof the plurality of sets of encoded data slices.

Subsequent to release of the multi-media content, the method continuesat step 268 where the processing module distributes a plurality ofpost-release sub-sets of the plurality of sets of encoded data slices tothe user device in accordance with the selected post-release datadistribution protocol. A first post-release sub-set of the plurality ofpost-release sub-sets includes one or more encoded data slices of theset of encoded data slices such that the first pre-release sub-set andthe first post-release sub-set includes at least a decode thresholdnumber of encoded data slices of the set of encoded data slices.

FIG. 12A is a schematic block diagram of another embodiment of acomputing system that includes a computing device 270 and plurality ofaccessing devices 272. The computing device 270 may be implemented as adispersed storage (DS) processing unit, a user device, and/or a DS unit.The computing device 270 may distribute at least a portion ofmulti-media content 166 to the plurality of user devices 272 inaccordance with a preview approach. For example, the computing device270 is a DS processing unit commissioned to distribute a first portionof the multi-media content 166 to an accessing device 272 prior topurchase of the multi-media content 166 by the accessing device 272 andto distribute a customized preview of the multi-media content 166 to theaccessing device 272. The computing device 270 includes a DS module 274which includes a receive request module 276, an identify data segmentsmodule 278, and a send module 280.

The multi-media content 166 is divided into data segments and the datasegments are encoded utilizing a dispersed storage error coding functionto produce sets of encoded data slices. Each set of encoded data slicesincludes a first sub-set of encoded data slices and a second sub-set ofencoded data slices. Each first sub-set of encoded data includes lessthan a decode threshold number of encoded data slices. The accessingdevice 272 possesses first sub-sets of encoded data slices.

The receive request module 276 receives an access request 282 for acustomized preview of multi-media content 166 from the accessing device272. The access request 282 includes at least one of a multi-mediacontent identifier (ID) corresponding to the multi-media content 166, apreview ID corresponding to the customized preview of the multi-mediacontent, a preview descriptor corresponding to the customized preview ofthe multi-media content (e.g., an actor name, a scene description, musicverse, speech text, etc.), data segment IDs of a set of data segmentscorresponding to the customized preview, and one more slice names of atleast one encoded data slice (e.g., indicating what is in possession bythe accessing device).

The identify segments module 278 identifies the set of data segmentscorresponding to the customized preview of the multi-media content basedon identity information of the accessing device. The identityinformation includes one or more of identity of the accessing device,identity of a style of previewing multi-media content, a request for thecustomized preview, and preview preference information. The identifysegments module 278 may identify the set of data segments and a varietyof ways. For example, the identify segments module 278 identifies theset of data segments by determining the customized preview based on theidentity information and identifying the set of data slicescorresponding to the customized preview. As an instance of the example,the identify segments module 278 selects a customized preview thatincludes scenes that include a particular actor when preview preferenceinformation corresponding to the identity of the accessing deviceindicates a preference for the particular actor. As another example, theidentify segments module 278 identifies the set of data segments byinterpreting the identity information to determine preview preferenceinformation, generate the customized preview based on the previewpreference information, and identifying the set of data slicescorresponding to the customized preview.

The send module 280 sends to the accessing device 272, at least oneencoded data slice 284 of a second sub-set of encoded data slices thatcorresponds to a data segment of the set of data segments. The sendmodule 280 sends the at least one encoded data slice 284 by obtainingthe at least one encoded data slice 284 and outputting the at least oneencoded data slice 284. The send module 280 obtains the at least oneencoded data slice 284 by at least one of encoding the multi-mediacontent 166 to generate the at least one encoded data slice 284 andretrieving slices 254 from a dispersed storage network memory thatincludes second sub-set encoded data slices.

The send module 280 outputs the at least one encoded data slice 284 tothe accessing device 272 by at least one of a variety of ways. Forexample, the send module 280 generates viewing information and embedsthe viewing information with the at least one encoded data slice 284.The viewing information includes one or more of number of allowed views,an expiration time of the at least one encoded data slice, a sectionidentifier, segment identifiers corresponding to other segments of theplurality of segments. As another example, the send module 280 outputsthe at least one encoded data slice 284 to the accessing device 272 whenreceiving a play request 286 from the accessing device 272. As yetanother example, the send module 280 outputs the at least one encodeddata slice 284 to the access device 272 in accordance with a multi-mediastreaming approach (e.g., pacing outputting of slices with real-timeconsumption).

The computing device 270 may process access requests from any of theplurality of accessing devices 272. For example, the receive requestmodule 276 receives a second access request 282 for a second customizedpreview of the multi-media content from a second accessing device 272and the identify segments module 278 identifies a second set of datasegments corresponding to the second customized preview of themulti-media content based on second identity information of the secondaccessing device 272. Continuing with the preceding example, the sendmodule 280 sends, to the second accessing device 272, at least oneencoded data slice 284 of second sub-sets of encoded data slices thatcorresponds to a data segment of the second set of data segments.

FIG. 12B is a flowchart illustrating an example of downloading content.The method begins at step 290 where a processing module (e.g., adispersed storage (DS) processing module) receives an access request fora customized preview of multi-media content from an accessing device.The multi-media content is divided into data segments and the datasegments are encoded utilizing a dispersed storage error coding functionto produce sets of encoded data slices. Each set of encoded data slicesincludes a first sub-set of encoded data slices and a second sub-set ofencoded data slices. Each first sub-set of encoded data includes lessthan a decode threshold number of encoded data slices. The accessingdevice possesses first sub-sets of encoded data slices prior to issuingthe access request.

The method continues at step 292 where the processing module identifiesa set of data segments of the data segments corresponding to thecustomized preview of the multi-media content based on identityinformation of the accessing device. The processing module may identifythe set of data segments in a variety of ways. For example, theprocessing module identifies the set of data segments by determining thecustomized preview based on the identity information and identifying theset of data slices corresponding to the customized preview. As anotherexample, the processing module identifies the set of data segments byinterpreting the identity information to determine preview preferenceinformation, generating the customized preview based on the previewpreference information, and identifying the set of data slicescorresponding to the customized preview.

The method continues at step 294 where the processing module sends, tothe accessing device, at least one encoded data slice of a secondsub-set of encoded data slices that corresponds to a data segment of theset of data segments. The sending the at least one encoded data slice tothe accessing device further includes at least one of generating viewinginformation and embedding the viewing information with the at least oneencoded data slice, outputting the at least one encoded data slice tothe accessing device when receiving a play request from the accessingdevice, and outputting the at least one encoded data slice to the accessdevice in accordance with a multi-media streaming approach.

The method continues at step 296 where the processing module receives asecond access request for a second customized preview of the multi-mediacontent from a second accessing device. The method continues at step 298where the processing module identifies a second set of data segments ofthe data segments corresponding to the second customized preview of themulti-media content based on second identity information of the secondaccessing device. The method continues at step 300 where the processingmodule sends, to the second accessing device, at least one encoded dataslice of one of the second sub-set of encoded data slices thatcorresponds to a data segment of the second set of data segments.

FIG. 13 is a flowchart illustrating another example of completing acontent download, which includes similar steps to FIG. 9. The methodbegins with step 302 where a processing module (e.g., of a user device)determines a plurality of content identifiers (IDs) associated withstored slices. The determining may be based on one or more of a contentlist, searching a dispersed storage network (DSN) memory for storingslices associated with content, a data type indicator, a directory, afilename, and a filename extension. For example, the processing moduledetermines the plurality of content IDs based on identifying filenameextensions in a directory that include a movie indicator.

The method continues at step 304 where the processing module determinesdesired content. The determining may be based on one or more ofidentifying content IDs associated with most desirable content, acalendar event, a request, a consumption requirement, a previousconsumption pattern, a preferred content list, a purchase content list,and a content wish list. For example, the processing module identifiesthe content ID associated with family pictures when a calendar eventindicates that a family event is scheduled.

The method continues at step 306 where the processing module determinesdesired content timing. The desired content timing indicates a timewindow when the desired content shall be available for consumption. Thedetermining may be based on one or more of the desired content, anestimate of time to download slices of incremental pillars, a calendarevent, a user input, the previous consumption pattern, and a preferredtiming list. For example, the processing module identifies the desiredcontent timing as two hours prior to the family event indicated in thecalendar event.

The method continues with steps 200, 202, and 204 of FIG. 9 where, forthe desired content, the processing module determines stored pillars,determines an allowed pillar combination, and determines incrementalpillars based on the stored pillars and the allowed pillar combination.The method continues at step 314 where the processing module obtains theincremental pillars in accordance with the desired content timing. Theobtaining includes requesting slices associated with the incrementalpillars and sending slice requests such that the slices associated withthe incremental pillars are received in accordance with the desiredcontent timing. For sample, the processing module sends slice requestsone hour in advance of the family event and receives the slicesassociated with the incremental pillars prior to the family event. Themethod continues at step 316 where the processing module deletes theincremental pillars in accordance with the desired content timing. Forexample, the processing module deletes the slices associated withincremental pillars 24 hours after the family event ends.

FIG. 14A is a block diagram of an embodiment of a data storagestructure, which includes a database 320 that includes entriescorresponding to data stored in a dispersed storage network (DSN)memory. Each entry includes a data name field 322, metadata field 324, adata dispersed storage network (DSN) address field 326, and a metadataDSN address field 328. For each entry of the database 320, the data namefield 322 includes a data identifier (ID) corresponding to dataassociated with the entry. The data ID may be represented as one of moretypes including at least one of a file system path name, a contentidentifier (ID), a block number, and an object number. The metadatafield 324 includes metadata corresponding to the data. The metadataincludes one or more of a data revision indicator, a metadata revisionindicator, a data size indicator, a data type indicator, a data hashdigest, a security level indicator, an owner ID, data integrityinformation, a timestamp, a segment allocation table DSN address, and anaccess permission indicator. The data DSN address field 326 includes aDSN address corresponding to a storage location of the data within theDSN memory. The DSN address may include a source name and/or one or moresets of slice names. The metadata DSN address field 328 includes a DSNaddress corresponding to a storage location of the metadata within theDSN memory.

The database 320 may be stored in a local memory and/or in the DSNmemory as encoded database slices. The database 320 may be utilized asan index to facilitate data access within the DSN memory. For example, ametadata DSN address is extracted from an entry of the database andcorresponding metadata is retrieved from the DSN memory utilizing themetadata DSN address. The metadata is compared to a search criteria anda match may be indicated when the metadata compares favorably to thesearch criteria. When the match is indicated, a data DSN address isextracted from the entry of the database and utilized to recover datafrom the DSN memory.

FIG. 14B is a block diagram of an embodiment of a data storage system,which includes a plurality of combiners 330, a plurality of encoders332, a plurality of appenders 334, and a dispersed storage network (DSN)memory 22. The data storage system is operable to store data at a dataDSN address 326 within the DSN memory 22 and to store metadata 324 ofthe data at a metadata DSN address 328 within the DSN memory 22. Thestoring of the data includes including the metadata DSN address 328 withthe data and the storing of the metadata 324 includes including the dataDSN address 326 with the metadata 324. The storing of the data and themetadata 324 may be accomplished utilizing at least two approaches.

In a first approach to store the data, combiner 330 combines a datasegment 336 of the data with the metadata DSN address 328 to produce anamended data segment 338. For example, the data is segmented into aplurality of data segments that includes the data segment. A first datasegment of the plurality of data segments is selected as the datasegment 336 to be combined with the metadata DSN address 328 to producethe amended data segment 338. Continuing with the first approach,encoder 332 dispersed storage error encodes the amended data segment 338to produce a set of data slices 340. Next, the set of data slices 340are stored in the DSN memory 22.

In a first approach to store the metadata, combiner 330 combinesmetadata 324 with the data DSN address 326 to produce amended metadata342. For example, the data is analyzed to produce the metadata 324 andthe data DSN address 326 is appended to the beginning of the metadata324 to produce the amended metadata 342. Continuing with the firstapproach, encoder 332 dispersed storage error encodes the amendedmetadata 342 to produce a set of metadata slices 344. Next, the set ofmetadata slices 344 are stored in the DSN memory 22.

In a second approach to store the data, encoder 332 dispersed storageerror encodes the data segment 336 to produce a preliminary set ofencoded data slices 346. Next, the appender 334 appends the metadata DSNaddress 328 with at least some of the encoded data slices of thepreliminary set of encoded data slices 346 to produce a set of encodeddata slices 348. For example, the appender 334 appends the metadata DSNaddress 328 to the end of a decode threshold number of encoded dataslices of the preliminary set of encoded data slices 346 to produce theset of encoded data slices 348. Next, the set of encoded data slices 348is stored in the DSN memory 22.

In a second approach to store the metadata, encoder 332 dispersedstorage error encodes the metadata 324 to produce a preliminary set ofencoded metadata slices 350. Next, the appender 334 appends the data DSNaddress 326 with at least some of the encoded metadata slices of thepreliminary set of encoded metadata slices 350 to produce a set ofencoded metadata slices 352. For example, the appender 334 appends thedata DSN address 326 to the end of a decode threshold number of encodedmetadata slices of the preliminary set of encoded metadata slices 350 toproduce the set of encoded metadata slices 352. Next, the set of encodedmetadata slices 352 is stored in the DSN memory 22. The approaches tostore the data and the metadata 324 in the DSN memory 22 are discussedin greater detail of reference to FIGS. 15A, 15B, 15C, and 15D.

FIG. 15A is a schematic block diagram of another embodiment of acomputing system that includes a computing device 360 and a dispersedstorage network (DSN) memory 22. The DSN memory 22 includes one or moresets of dispersed storage (DS) units 36. The computing device 360 may beimplemented as a dispersed storage (DS) processing unit, a user device,and/or a DS unit. The computing device 360 may store data 376 andmetadata 324 of the data 376 in the DSN memory 22 in accordance with astorage approach. For example, the computing device 360 is a DSprocessing unit commissioned to receive data 376, generate metadata 324of the data 376, store the data 376 in the DSN memory 22, and store themetadata 324 in the DSN memory 22. The computing device 360 includes aDS module 362 and memory 364. The DS module 362 includes a generateslices module 366, a generate metadata slices module 368, a generatemetadata write commands module 370, a generate data write commandsmodule 372, and an update database module 374.

The generate slices module 366 generates a set of encoded data slices340 based on a data segment of the data 376 and DSN addressinginformation 328 regarding metadata 324 of the data 376. The DSNaddressing information 328 regarding the metadata 324 includes at leastone of a metadata source name and at least one set of metadata slicenames. The generate slices module 366, the generate metadata slicesmodule 368, and or the generate metadata write commands module 370 mayinclude an obtain DSN addressing information function which causes theDS module 362 to obtain the DSN addressing information 328 regarding themetadata 324 in a variety of ways. For example, the obtaining includes,when a data name associated with the data 376 is a new data name,identifying a vault identifier (ID) associated with the data 376,accessing a vault utilizing the vault ID to retrieve dispersed storageerror coding function parameters, and generating a metadata source namebased on the vault ID and the dispersed storage error coding functionparameters. As another example, the obtaining includes, when the dataname associated with the data 376 is not a new data name, retrieving themetadata source name from a database of memory 364 utilizing the dataname.

The generate slices module 366 may generate the set of encoded dataslices 340 in utilizing a variety of approaches. In a first approach,the generate slices module 366 combines the DSN addressing information328 regarding metadata 324 with a data segment of the data 376 toproduce an amended data segment. Next, the generate slices module 366dispersed storage error encodes the amended data segment to produce theset of encoded data slices 340. In a second approach, the generateslices module 366 dispersed storage error encodes the data segment toproduce a preliminary set of encoded data slices. Next, the generateslices module 366 appends the DSN addressing information 328 regardingthe metadata 324 with at least some of the encoded data slices of thepreliminary set of encoded data slices to produce the set of encodeddata slices 340.

The generate metadata slices module 368 generates a set of encodedmetadata slices 344 based on the metadata 324 and DSN addressinginformation 326 regarding the data 376. The DSN addressing information326 regarding the data 376 includes at least one of a data source nameand at least one set of data slice names. The generate slices module366, the generate metadata slices module 368, and or the generate datawrite commands module 372 may include another obtain DSN addressinginformation function which causes the DS module 362 to obtain the DSNaddressing information 326 regarding the data 376 in a variety of ways.For example, the obtaining includes identifying the vault identifier(ID) associated with the data 376, accessing the vault utilizing thevault ID to retrieve the dispersed storage error coding functionparameters, and generating a data source name based on the vault ID andthe dispersed storage error coding function parameters.

The generate metadata slices module 368 may generate the set of encodedmetadata slices 344 in utilizing a variety of approaches. In a firstapproach, the generate slices module 368 combines the DSN addressinginformation 326 regarding data 376 with the metadata 324 to produceamended metadata. Next, the generate metadata slices module 368dispersed storage error encodes the amended metadata segment to producethe set of encoded metadata slices 344. In a second approach, thegenerate metadata slices module 368 dispersed storage error encodes themetadata 324 to produce a preliminary set of encoded metadata slices.Next, the generate slices module 368 appends the DSN addressinginformation 326 regarding the data 376 with at least some of the encodedmetadata slices of the preliminary set of encoded metadata slices toproduce the set of encoded metadata slices 344.

The generate metadata write commands module 370 generates a set ofmetadata write commands 378 regarding storing the set of encodedmetadata slices 344 in a first set of DS units 36 of the DSN memory 22.For example, the generate metadata write commands module 370 generates aset of write slice requests that includes the set of encoded metadataslices 344 and is targeted for sending to the first set of DS units 36.Next, the computing device 360 sends the set of write slice requeststhat includes the set of encoded metadata slices 344 to the first set ofDS units 36.

The generate data write commands module 372 module generates a set ofdata segment write commands 380 regarding storing the set of encodeddata slices 340 in a second set of DS units 36 of the DSN memory 22. Forexample, the generate data write commands module 372 generates a set ofwrite slice requests that includes the set of encoded data slices 340and is targeted for sending to the second set of DS units 36. The firstset of DS units 36 may be substantially the same as the second set of DSunits 36. Next, the computing device 360 sends the set of write slicerequests that includes the set of encoded data slices 340 to the secondof set of DS units 36.

The update database module 374 generates a database entry 382 to includeone or more of a data name of the data 376, the metadata 324, the DSNaddressing information regarding 328 the metadata 324, and DSNaddressing information 326 regarding the data 376 and updates thedatabase to include the database entry 382. The update database module374 may update the database in a variety of ways including one or moreof retrieving at least a portion of the database from one of the DSNmemory 22 and the memory 364, appending the database entry 382 to the atleast the portion of the database to produce an updated databaseportion, overwriting a previous database entry corresponding to the dataname with the database entry 382 to produce the updated databaseportion, and facilitating storage of the updated database portion in atleast one of the memory 364 and the DSN memory 22.

FIG. 15B is a flowchart illustrating an example of storing data. Themethod begins at step 390 where a processing module (e.g., of adispersed storage (DS) processing unit) generates a set of encoded dataslices based on a data segment of data and dispersed storage network(DSN) addressing information regarding metadata of the data. Thegenerating the set of encoded data slices may include combining the DSNaddressing information regarding metadata with the data segment toproduce an amended data segment and dispersed storage error encoding theamended data segment to produce the set of encoded data slices. Thegenerating the set of encoded data slices may further include dispersedstorage error encoding the data segment to produce a preliminary set ofencoded data slices and appending the DSN addressing informationregarding the metadata with at least some of the encoded data slices ofthe preliminary set of encoded data slices to produce the set of encodeddata slices.

The method continues at step 392 where the processing module generates aset of encoded metadata slices based on the metadata and DSN addressinginformation regarding the data. The generating the set of encodedmetadata slices may include combining the DSN addressing informationregarding the data with the metadata to produce amended metadata anddispersed storage error encoding the amended metadata to produce the setof encoded metadata slices. The generating the set of encoded metadataslices may further include dispersed storage error encoding the metadatato produce a preliminary set of encoded metadata slices and appendingthe DSN addressing information regarding the data with at least some ofthe encoded metadata slices of the preliminary set of encoded metadataslices to produce the set of encoded metadata slices.

The method continues at step 394 were the processing module generates aset of metadata write commands regarding storing the set of encodedmetadata slices in a first set of dispersed storage (DS) units of DSNmemory. The method continues at step 396 where the processing modulegenerates a set of data segment write commands regarding storing the setof encoded data slices in a second set of DS units of the DSN memory.The method continues at step 398 where the processing module generates adatabase entry to include one or more of a data name of the data, themetadata, the DSN addressing information regarding the metadata, and DSNaddressing information regarding the data. The method continues at step400 where the processing module updates a database to include thedatabase entry.

FIG. 15C is a schematic block diagram of another embodiment of acomputing system that includes a computing device 410 and a dispersedstorage network (DSN) memory 22. The DSN memory 22 includes one or moresets of dispersed storage (DS) units 36. The computing device 410 may beimplemented as a dispersed storage (DS) processing unit, a user device,and/or a DS unit. The computing device 410 may store data 376 andmetadata 324 of the data 376 in the DSN memory 22 in accordance with astorage approach. For example, the computing device 360 is a DSprocessing unit commissioned to receive data 376, generate metadata 324of the data 376, store the data 376 in the DSN memory 22, and store themetadata 324 in the DSN memory 22. The computing device 410 includes aDS module 412 and memory 364. The DS module 412 includes a combinemodule 414, an encode module 416, an output module 418, and an updatedatabase module 374.

The combine module 414 functions to combine dispersed storage network(DSN) addressing information regarding metadata 324 of data 376 with adata segment of the data 376 to produce an amended data segment 338. Thecombine module 414 further functions to combine DSN addressinginformation 326 regarding the data 376 with the metadata 324 to produceamended metadata 342. The DSN addressing information 328 regarding themetadata 324 includes a metadata source name and or a set of metadataslice names. The DSN addressing information 326 regarding the data 376includes a data source name and or a set of data slice names.

The encode module 416 functions to dispersed storage error encode theamended data segment 338 to produce a set of encoded data slices 340.The encode module 416 further functions to dispersed storage errorencode the amended metadata 342 to produce a set of encoded metadataslices 344. The output module 418 outputs the set of encoded data slices340 and the set of encoded metadata slices 344 for storage in the DSNmemory 22.

The update database module 374 generates a database entry 382 to includeone or more of a data name of the data 376, the metadata 324, the DSNaddressing information 328 regarding the metadata 324, and DSNaddressing information 326 regarding the data 376 and updates a databaseto include the database entry 382. For example, the update databasemodule 374 stores the database entry 382 in the memory 364.

FIG. 15D is a flowchart illustrating another example of storing data,which includes similar steps to FIG. 15B. The method begins at step 420where a processing module (e.g., of a dispersed storage (DS) processingunit) combines dispersed storage network (DSN) addressing informationregarding metadata of data with a data segment of the data to produce anamended data segment. The method continues at step 422 where theprocessing module combines DSN addressing information regarding the datawith the metadata to produce amended metadata. The method continues atstep 424 where the processing module dispersed storage error encodes theamended data segment to produce a set of encoded data slices. The methodcontinues at step 426 where the processing module dispersed storageerror encodes the amended metadata to produce a set of encoded metadataslices. The method continues at step 428 where the processing moduleoutputs the set of encoded data slices and the set of encoded metadataslices for storage in a dispersed storage network. The method continueswith steps 398 and 400 of FIG. 15B where the processing module generatesa database entry to include one or more of a data name of the data, themetadata, the DSN addressing information regarding the metadata, and DSNaddressing information regarding the data and updates a database toinclude the database entry.

FIG. 16 is a flowchart illustrating an example of updating stored data.The method begins at step 430 where a processing module (e.g., of adispersed storage (DS) processing unit) receives a new data updaterequest. The request includes one or more of new data, a data name, anda user device identifier (ID). The method continues at step 432 wherethe processing module obtains a new metadata source name. The obtainingincludes at least one of assigning a new metadata source name and amaster database lookup utilizing the data name when reusing a metadatasource name (e.g., to write over previously stored metadata). The methodcontinues at step 434 where the processing module obtains a new datasource name. The obtaining includes at least one of assigning a new datasource name and a master database lookup utilizing the data name whenreusing a data source name (e.g., to write over previously stored dataassociated with the same data name).

The method continues at step 436 where the processing module stores thenew data and the new metadata source name in a dispersed storage network(DSN) memory utilizing the new data source name. The method continues atstep 438 where the processing module generates new metadata for the newdata. The method continues at step 440 where the processing moduleretrieves metadata for stored data associated with the new data. Forexample, the processing module retrieves the metadata from a masterdatabase based on the data name. As another example, the processingmodule retrieves the metadata from the DSN memory based on the metadatasource name.

The method continues at step 442 where the processing module modifiesthe metadata based on the new metadata to produce modified metadata. Forexample, the modified metadata includes a new metadata revisionindicator. The method continues at step 444 where the processing modulestores the modified metadata in the master database. The methodcontinues at step 446 where the processing module stores the modifiedmetadata and the new data source name in the DSN memory utilizing thenew metadata source name.

FIG. 17 is a flowchart illustrating an example of restoring data. Themethod begins at step 448 where a processing module (e.g., of adispersed storage (DS) processing unit) identifies objects stored in adispersed storage network (DSN) memory to produce identified objects.The identifying includes at least one of detecting a system reboot,detecting a memory loss, receiving a restore request, and searching theDSN memory for slices associated with objects (e.g., data objects,metadata objects). The method continues at step 450 where the processingmodule starts a restoration loop by initiating an analysis with ametadata object of the identified objects.

The method continues at step 452 where the processing module determineswhether a corresponding entry exists in a master database that includesthe same metadata revision number as the metadata object. The methodbranches to step 456 when the processing module determines that thecorresponding entry in the master database does not include the samemetadata revision number as the metadata object. The method continues tostep 454 when the processing module determines the corresponding entryin the master database includes the same metadata revision number as themetadata object. The method continues at step 454 where the processingmodule prepares to analyze a next metadata object of the plurality ofthe identified objects. The method loops back to step 452.

The method continues at step 456 where the processing module determineswhether the metadata object has the revision number greater than therevision number of the corresponding master database entry. The methodbranches to step 460 when the processing module determines that themetadata object does not have the version number greater than therevision number of the corresponding master database entry. The methodcontinues to step 458 when the processing module determines that themetadata object has the revision number greater than the revision numberof the corresponding master database entry. The method continues at step458 where the processing module updates a master database. The updatingincludes retrieving metadata from the DSN memory, modifying thecorresponding master database entry to produce a modified masterdatabase, and storing the modified master database. The method branchesto step 454.

The method continues at step 460 where the processing module generatesan updated metadata object when the processing module determines thatthe metadata object does not have the revision number greater than therevision number of the corresponding master database entry. Thegenerating includes combining the metadata from the master databaseentry with a data source name of the corresponding data to produce theupdated metadata object. The method continues at step 462 where theprocessing module stores the updated metadata object in the DSN memory.The method branches to step 454 to analyze the next metadata object. Therestoring may conclude when the method loops through each metadataobject of the identified objects.

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “operably coupled to”, “coupled to”, and/or “coupling” includesdirect coupling between items and/or indirect coupling between items viaan intervening item (e.g., an item includes, but is not limited to, acomponent, an element, a circuit, and/or a module) where, for indirectcoupling, the intervening item does not modify the information of asignal but may adjust its current level, voltage level, and/or powerlevel. As may further be used herein, inferred coupling (i.e., where oneelement is coupled to another element by inference) includes direct andindirect coupling between two items in the same manner as “coupled to”.As may even further be used herein, the term “operable to” or “operablycoupled to” indicates that an item includes one or more of powerconnections, input(s), output(s), etc., to perform, when activated, oneor more its corresponding functions and may further include inferredcoupling to one or more other items. As may still further be usedherein, the term “associated with”, includes direct and/or indirectcoupling of separate items and/or one item being embedded within anotheritem. As may be used herein, the term “compares favorably”, indicatesthat a comparison between two or more items, signals, etc., provides adesired relationship. For example, when the desired relationship is thatsignal 1 has a greater magnitude than signal 2, a favorable comparisonmay be achieved when the magnitude of signal 1 is greater than that ofsignal 2 or when the magnitude of signal 2 is less than that of signal1.

As may also be used herein, the terms “processing module”, “processingcircuit”, and/or “processing unit” may be a single processing device ora plurality of processing devices. Such a processing device may be amicroprocessor, micro-controller, digital signal processor,microcomputer, central processing unit, field programmable gate array,programmable logic device, state machine, logic circuitry, analogcircuitry, digital circuitry, and/or any device that manipulates signals(analog and/or digital) based on hard coding of the circuitry and/oroperational instructions. The processing module, module, processingcircuit, and/or processing unit may be, or further include, memoryand/or an integrated memory element, which may be a single memorydevice, a plurality of memory devices, and/or embedded circuitry ofanother processing module, module, processing circuit, and/or processingunit. Such a memory device may be a read-only memory, random accessmemory, volatile memory, non-volatile memory, static memory, dynamicmemory, flash memory, cache memory, and/or any device that storesdigital information. Note that if the processing module, module,processing circuit, and/or processing unit includes more than oneprocessing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

The present invention has been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claimed invention. Further, theboundaries of these functional building blocks have been arbitrarilydefined for convenience of description. Alternate boundaries could bedefined as long as the certain significant functions are appropriatelyperformed. Similarly, flow diagram blocks may also have been arbitrarilydefined herein to illustrate certain significant functionality. To theextent used, the flow diagram block boundaries and sequence could havebeen defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claimed invention. One of average skill in the artwill also recognize that the functional building blocks, and otherillustrative blocks, modules and components herein, can be implementedas illustrated or by discrete components, application specificintegrated circuits, processors executing appropriate software and thelike or any combination thereof.

The present invention may have also been described, at least in part, interms of one or more embodiments. An embodiment of the present inventionis used herein to illustrate the present invention, an aspect thereof, afeature thereof, a concept thereof, and/or an example thereof. Aphysical embodiment of an apparatus, an article of manufacture, amachine, and/or of a process that embodies the present invention mayinclude one or more of the aspects, features, concepts, examples, etc.described with reference to one or more of the embodiments discussedherein. Further, from figure to figure, the embodiments may incorporatethe same or similarly named functions, steps, modules, etc. that may usethe same or different reference numbers and, as such, the functions,steps, modules, etc. may be the same or similar functions, steps,modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of the various embodimentsof the present invention. A module includes a processing module, afunctional block, hardware, and/or software stored on memory forperforming one or more functions as may be described herein. Note that,if the module is implemented via hardware, the hardware may operateindependently and/or in conjunction software and/or firmware. As usedherein, a module may contain one or more sub-modules, each of which maybe one or more modules.

While particular combinations of various functions and features of thepresent invention have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent invention is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for execution by one or more processingunits of one or more computing devices within a dispersed storagenetwork (DSN), the method comprises: receiving, by the one or moreprocessing units of the one or more computing devices, a data searchcriteria; accessing a master database that includes a plurality ofentries, wherein an entry of the plurality of entries includes a dataname field, a metadata field, a data DSN address, and a metadata DSNaddress; indexing the database based on a comparison of the data searchcriteria with metadata contained in the metadata field of the pluralityof entries; when one or more entries of the database have the metadatathat substantially matches the data search criteria, utilizing the dataDSN address of the one or more entries to retrieve one or more sets ofencode data slices; and decoding the one or more sets of encoded dataslices to retrieve one or more data segments corresponding to the datasearch criteria.
 2. The method of claim 1, wherein the accessing themaster database comprises: retrieving one or more sets of encodeddatabase slices from storage units of the DSN; and decoding the one ormore sets of encoded database slices to reconstruct the master database.3. The method of claim 1, wherein the indexing the database comprises:when the one or more entries of the database have the metadata thatsubstantially matches the data search criteria: utilizing the metadataDSN address of the one or more entries to retrieve one or more sets ofencoded metadata slices; decoding the one or more sets of encodedmetadata slices to produce one or more reconstructed metadata; comparingthe metadata of the master database with the reconstructed metadata; andwhen the metadata of the master database compares favorably with thereconstructed metadata, indicating that the one or more entries of thedatabase have the metadata that substantially matches the data searchcriteria.
 4. The method of claim 3 further comprises: when the metadataof the master database does not compare favorably with the reconstructedmetadata, determining whether the metadata of the master database is outof date or whether the reconstructed metadata is out of date; when themetadata of the master database is out of date, updating the metadata ofthe master database based on the reconstructed metadata; and when thereconstructed metadata is out of data, updating the reconstructedmetadata based on the metadata of the master database.
 5. The method ofclaim 1, wherein the indexing the database comprises: when the one ormore entries of the database have the metadata that substantiallymatches the data search criteria: utilizing the metadata DSN address ofthe one or more entries to retrieve one or more sets of encoded metadataslices; decoding the one or more sets of encoded metadata slices toproduce one or more reconstructed metadata and one or more reconstructeddata DSN addresses; comparing the data DSN address of the one or moreentries with the one or more reconstructed data DSN addresses; and whenthe data DSN address of the one or more entries compares favorably withthe one or more reconstructed data DSN addresses, indicating that theone or more entries of the database have the metadata that substantiallymatches the data search criteria.
 6. The method of claim 5 furthercomprises: when the data DSN address of the one or more entries does notcompare favorably with the one or more reconstructed data DSN addresses,determining whether the data DSN address of the one or more entries isout of date or whether the one or more reconstructed data DSN addressesis out of date; when the data DSN address of the one or more entries isout of date, updating the master database based on the reconstructeddata DSN addresses; and when the reconstructed data DSN addresses areout of date, updating the one or more sets of encoded metadata slicesbased on the data DSN address of the one or more entries.
 7. The methodof claim 1, wherein the decoding the one or more sets of encoded dataslices further comprises: producing one or more reconstructed metadataDSN addresses; comparing the one or more reconstructed metadata DSNaddresses with the metadata DSN addresses of the one or more entries ofthe master database; when the one or more reconstructed metadata DSNaddresses compares unfavorably with the metadata DSN addresses of theone or more entries of the master database, determining whether the oneor more reconstructed metadata DSN addresses is out of date or whetherthe metadata DSN addresses of the one or more entries of the masterdatabase is out of date; when the one or more reconstructed metadata DSNaddresses is out of date, updating the one or more sets of encoded dataslices based on the metadata DSN addresses of the one or more entries ofthe master database; and when the metadata DSN addresses of the one ormore entries of the master database is out of date, updating the one ormore entries of the database based on the one or more reconstructedmetadata DSN addresses.
 8. A computing device comprises: a first module,when operable within the computing device, causes the computing deviceto: receive a data search criteria; a second module, when operablewithin the computing device, causes the computing device to: access amaster database that includes a plurality of entries, wherein an entryof the plurality of entries includes a data name field, a metadatafield, a data dispersed storage network (DSN) address, and a metadataDSN address; a third module, when operable within the computing device,causes the computing device to: index the database based on a comparisonof the data search criteria with metadata contained in the metadatafield of the plurality of entries; a fourth module, when operable withinthe computing device, causes the computing device to: when one or moreentries of the database have the metadata that substantially matches thedata search criteria, utilize the data DSN address of the one or moreentries to retrieve one or more sets of encode data slices; and a fifthmodule, when operable within the computing device, causes the computingdevice to: decode the one or more sets of encoded data slices toretrieve one or more data segments corresponding to the data searchcriteria.
 9. The computing device of claim 8, wherein the second module,when operable within the computing device, further causes the computingdevice to access the master database by: retrieving one or more sets ofencoded database slices from storage units of the DSN; and decoding theone or more sets of encoded database slices to reconstruct the masterdatabase.
 10. The computing device of claim 8, wherein the third module,when operable within the computing device, further causes the computingdevice to index the database by: when the one or more entries of thedatabase have the metadata that substantially matches the data searchcriteria: utilizing the metadata DSN address of the one or more entriesto retrieve one or more sets of encoded metadata slices; decoding theone or more sets of encoded metadata slices to produce one or morereconstructed metadata; comparing the metadata of the master databasewith the reconstructed metadata; and when the metadata of the masterdatabase compares favorably with the reconstructed metadata, indicatingthat the one or more entries of the database have the metadata thatsubstantially matches the data search criteria.
 11. The computing deviceof claim 10, wherein the third module, when operable within thecomputing device, further causes the computing device to: when themetadata of the master database does not compare favorably with thereconstructed metadata, determine whether the metadata of the masterdatabase is out of date or whether the reconstructed metadata is out ofdate; when the metadata of the master database is out of date, updatethe metadata of the master database based on the reconstructed metadata;and when the reconstructed metadata is out of data, update thereconstructed metadata based on the metadata of the master database. 12.The computing device of claim 8, wherein the third module, when operablewithin the computing device, further causes the computing device toindex the database by: when the one or more entries of the database havethe metadata that substantially matches the data search criteria:utilizing the metadata DSN address of the one or more entries toretrieve one or more sets of encoded metadata slices; decoding the oneor more sets of encoded metadata slices to produce one or morereconstructed metadata and one or more reconstructed data DSN addresses;comparing the data DSN address of the one or more entries with the oneor more reconstructed data DSN addresses; and when the data DSN addressof the one or more entries compares favorably with the one or morereconstructed data DSN addresses, indicating that the one or moreentries of the database have the metadata that substantially matches thedata search criteria.
 13. The computing device of claim 12, wherein thethird module, when operable within the computing device, further causesthe computing device to: when the data DSN address of the one or moreentries does not compare favorably with the one or more reconstructeddata DSN addresses, determine whether the data DSN address of the one ormore entries is out of date or whether the one or more reconstructeddata DSN addresses is out of date; when the data DSN address of the oneor more entries is out of date, update the master database based on thereconstructed data DSN addresses; and when the reconstructed data DSNaddresses are out of date, update the one or more sets of encodedmetadata slices based on the data DSN address of the one or moreentries.
 14. The computing device of claim 12, wherein the fifth module,when operable within the computing device, further causes the computingdevice to decode the one or more sets of encoded data slices further by:producing one or more reconstructed metadata DSN addresses; comparingthe one or more reconstructed metadata DSN addresses with the metadataDSN addresses of the one or more entries of the master database; whenthe one or more reconstructed metadata DSN addresses comparesunfavorably with the metadata DSN addresses of the one or more entriesof the master database, determining whether the one or morereconstructed metadata DSN addresses is out of date or whether themetadata DSN addresses of the one or more entries of the master databaseis out of date; when the one or more reconstructed metadata DSNaddresses is out of date, updating the one or more sets of encoded dataslices based on the metadata DSN addresses of the one or more entries ofthe master database; and when the metadata DSN addresses of the one ormore entries of the master database is out of date, updating the one ormore entries of the database based on the one or more reconstructedmetadata DSN addresses.